./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum10-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 b78c6753a189c9cd2a3a6780fd233a43244cd2f3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:12:05,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 22:12:05,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 22:12:05,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 22:12:05,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 22:12:05,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 22:12:05,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 22:12:05,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 22:12:05,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 22:12:05,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 22:12:05,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 22:12:05,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 22:12:05,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 22:12:05,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 22:12:05,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 22:12:05,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 22:12:05,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 22:12:05,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 22:12:05,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 22:12:05,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 22:12:05,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 22:12:05,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 22:12:05,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 22:12:05,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 22:12:05,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 22:12:05,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 22:12:05,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 22:12:05,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 22:12:05,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 22:12:05,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 22:12:05,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 22:12:05,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 22:12:05,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 22:12:05,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 22:12:05,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 22:12:05,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 22:12:05,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 22:12:05,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 22:12:05,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 22:12:05,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 22:12:05,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 22:12:05,333 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 22:12:05,359 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 22:12:05,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 22:12:05,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 22:12:05,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 22:12:05,360 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 22:12:05,361 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 22:12:05,361 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 22:12:05,361 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 22:12:05,361 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 22:12:05,361 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 22:12:05,361 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 22:12:05,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 22:12:05,362 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 22:12:05,362 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 22:12:05,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 22:12:05,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 22:12:05,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 22:12:05,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 22:12:05,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 22:12:05,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 22:12:05,363 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 22:12:05,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 22:12:05,364 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 22:12:05,364 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 22:12:05,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 22:12:05,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 22:12:05,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 22:12:05,365 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 22:12:05,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 22:12:05,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 22:12:05,365 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 22:12:05,365 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 22:12:05,366 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 22:12:05,366 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_3ece0d86-bdde-4598-8816-7dedc5a9c767/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_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 -> b78c6753a189c9cd2a3a6780fd233a43244cd2f3 [2020-11-29 22:12:05,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 22:12:05,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 22:12:05,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 22:12:05,670 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 22:12:05,671 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 22:12:05,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum10-1.i [2020-11-29 22:12:05,741 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/data/a26c30325/fa49a36f4efb49aabdf39e4a08ad93cf/FLAGa28f0f46c [2020-11-29 22:12:06,190 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 22:12:06,191 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/sv-benchmarks/c/reducercommutativity/sum10-1.i [2020-11-29 22:12:06,197 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/data/a26c30325/fa49a36f4efb49aabdf39e4a08ad93cf/FLAGa28f0f46c [2020-11-29 22:12:06,587 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/data/a26c30325/fa49a36f4efb49aabdf39e4a08ad93cf [2020-11-29 22:12:06,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 22:12:06,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 22:12:06,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 22:12:06,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 22:12:06,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 22:12:06,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73549109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06, skipping insertion in model container [2020-11-29 22:12:06,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 22:12:06,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 22:12:06,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:12:06,823 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 22:12:06,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:12:06,858 INFO L208 MainTranslator]: Completed translation [2020-11-29 22:12:06,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06 WrapperNode [2020-11-29 22:12:06,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 22:12:06,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 22:12:06,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 22:12:06,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 22:12:06,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 22:12:06,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 22:12:06,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 22:12:06,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 22:12:06,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... [2020-11-29 22:12:06,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 22:12:06,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 22:12:06,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 22:12:06,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 22:12:06,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:07,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 22:12:07,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 22:12:07,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 22:12:07,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 22:12:07,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 22:12:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 22:12:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 22:12:07,430 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 22:12:07,430 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-11-29 22:12:07,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:12:07 BoogieIcfgContainer [2020-11-29 22:12:07,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 22:12:07,432 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 22:12:07,433 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 22:12:07,436 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 22:12:07,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 22:12:07,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 10:12:06" (1/3) ... [2020-11-29 22:12:07,438 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35672a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 10:12:07, skipping insertion in model container [2020-11-29 22:12:07,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 22:12:07,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:12:06" (2/3) ... [2020-11-29 22:12:07,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35672a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 10:12:07, skipping insertion in model container [2020-11-29 22:12:07,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 22:12:07,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:12:07" (3/3) ... [2020-11-29 22:12:07,440 INFO L373 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2020-11-29 22:12:07,484 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 22:12:07,484 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 22:12:07,484 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 22:12:07,485 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 22:12:07,485 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 22:12:07,485 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 22:12:07,485 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 22:12:07,485 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 22:12:07,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-11-29 22:12:07,514 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-11-29 22:12:07,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:07,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:07,520 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 22:12:07,520 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:07,521 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 22:12:07,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-11-29 22:12:07,525 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-11-29 22:12:07,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:07,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:07,526 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 22:12:07,526 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:07,531 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 9#L34-3true [2020-11-29 22:12:07,531 INFO L796 eck$LassoCheckResult]: Loop: 9#L34-3true assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 11#L34-2true main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 9#L34-3true [2020-11-29 22:12:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 22:12:07,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:07,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131439017] [2020-11-29 22:12:07,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:07,633 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:07,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:07,667 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-29 22:12:07,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:07,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656065544] [2020-11-29 22:12:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:07,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:07,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:07,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:07,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-29 22:12:07,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:07,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084208775] [2020-11-29 22:12:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:07,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:07,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:07,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:08,198 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-11-29 22:12:08,300 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 22:12:08,300 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 22:12:08,300 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 22:12:08,300 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 22:12:08,300 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 22:12:08,300 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:08,301 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 22:12:08,301 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 22:12:08,301 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2020-11-29 22:12:08,301 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 22:12:08,301 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 22:12:08,325 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 22:12:08,342 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 22:12:08,345 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 22:12:08,348 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 22:12:08,354 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 22:12:08,358 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 22:12:08,373 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 22:12:08,392 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 22:12:08,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 22:12:08,399 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 22:12:08,620 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 22:12:08,624 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 22:12:08,629 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 22:12:08,634 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 22:12:08,638 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 22:12:08,646 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 22:12:08,649 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 22:12:08,653 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 22:12:08,657 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 22:12:08,972 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 22:12:08,977 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:08,984 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 22:12:08,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:08,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:08,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:08,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:08,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:08,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:08,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:08,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,017 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 22:12:09,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:09,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:09,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:09,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:09,043 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 22:12:09,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:09,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:09,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:09,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:09,080 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 22:12:09,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:09,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:09,133 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 22:12:09,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:09,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:09,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:12:09,178 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 22:12:09,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:09,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:09,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,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_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:12:09,223 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 22:12:09,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:09,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:09,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:09,262 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 22:12:09,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:09,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_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:09,327 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 22:12:09,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:09,392 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 22:12:09,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:09,442 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 22:12:09,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:09,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:09,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:12:09,488 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 22:12:09,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:12:09,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 [2020-11-29 22:12:09,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:12:09,597 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 22:12:09,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:09,648 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 22:12:09,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:09,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,684 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 22:12:09,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:09,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:09,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:09,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:09,711 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 22:12:09,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:09,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:09,767 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 22:12:09,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:09,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:09,828 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 22:12:09,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:09,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:09,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:09,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:09,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:09,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,848 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 22:12:09,902 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-11-29 22:12:09,903 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:09,911 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:09,937 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 22:12:09,937 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 22:12:09,938 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2020-11-29 22:12:09,988 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-11-29 22:12:09,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 22:12:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:10,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 22:12:10,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:10,100 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 22:12:10,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:10,241 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 22:12:10,252 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 22:12:10,253 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 3 states. [2020-11-29 22:12:10,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 3 states. Result 69 states and 97 transitions. Complement of second has 8 states. [2020-11-29 22:12:10,366 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 22:12:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 22:12:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2020-11-29 22:12:10,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-29 22:12:10,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:12:10,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-29 22:12:10,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:12:10,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-29 22:12:10,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:12:10,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 97 transitions. [2020-11-29 22:12:10,380 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:10,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2020-11-29 22:12:10,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-11-29 22:12:10,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:10,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2020-11-29 22:12:10,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:10,389 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-29 22:12:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2020-11-29 22:12:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-11-29 22:12:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-29 22:12:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-11-29 22:12:10,413 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-29 22:12:10,413 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-29 22:12:10,413 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 22:12:10,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-11-29 22:12:10,414 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:10,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:10,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:10,414 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-29 22:12:10,415 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:10,415 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 176#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 173#L34-3 assume !(main_~i~1 < 10); 172#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 165#L20-3 [2020-11-29 22:12:10,415 INFO L796 eck$LassoCheckResult]: Loop: 165#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 166#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 165#L20-3 [2020-11-29 22:12:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-11-29 22:12:10,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:10,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404545907] [2020-11-29 22:12:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:10,486 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 22:12:10,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404545907] [2020-11-29 22:12:10,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:12:10,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:12:10,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311596100] [2020-11-29 22:12:10,489 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2020-11-29 22:12:10,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:10,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146333490] [2020-11-29 22:12:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:10,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:10,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:10,510 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:10,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 22:12:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 22:12:10,564 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-11-29 22:12:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:10,577 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-11-29 22:12:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:12:10,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2020-11-29 22:12:10,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:10,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2020-11-29 22:12:10,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:10,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:10,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2020-11-29 22:12:10,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:10,581 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-11-29 22:12:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2020-11-29 22:12:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-11-29 22:12:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-29 22:12:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-11-29 22:12:10,583 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-11-29 22:12:10,583 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-11-29 22:12:10,583 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 22:12:10,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2020-11-29 22:12:10,584 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:10,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:10,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:10,584 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-29 22:12:10,584 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:10,584 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 221#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 218#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 219#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 220#L34-3 assume !(main_~i~1 < 10); 217#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 210#L20-3 [2020-11-29 22:12:10,585 INFO L796 eck$LassoCheckResult]: Loop: 210#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 211#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 210#L20-3 [2020-11-29 22:12:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-11-29 22:12:10,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:10,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052471780] [2020-11-29 22:12:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:10,647 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 22:12:10,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052471780] [2020-11-29 22:12:10,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375382325] [2020-11-29 22:12:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:10,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 22:12:10,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:10,721 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 22:12:10,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:10,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 22:12:10,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014967461] [2020-11-29 22:12:10,723 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2020-11-29 22:12:10,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:10,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625146706] [2020-11-29 22:12:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:10,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:10,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:10,734 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:10,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:12:10,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:12:10,769 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-11-29 22:12:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:10,792 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-11-29 22:12:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:12:10,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2020-11-29 22:12:10,793 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:10,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2020-11-29 22:12:10,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:10,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:10,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2020-11-29 22:12:10,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:10,795 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-11-29 22:12:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2020-11-29 22:12:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-11-29 22:12:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-29 22:12:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-11-29 22:12:10,797 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-11-29 22:12:10,797 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-11-29 22:12:10,797 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 22:12:10,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2020-11-29 22:12:10,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:10,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:10,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:10,798 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-11-29 22:12:10,798 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:10,799 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 286#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 282#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 283#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 284#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 285#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 292#L34-3 assume !(main_~i~1 < 10); 281#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 274#L20-3 [2020-11-29 22:12:10,799 INFO L796 eck$LassoCheckResult]: Loop: 274#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 275#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 274#L20-3 [2020-11-29 22:12:10,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:10,799 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-11-29 22:12:10,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:10,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035424862] [2020-11-29 22:12:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:10,865 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 22:12:10,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035424862] [2020-11-29 22:12:10,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102423616] [2020-11-29 22:12:10,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:10,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:12:10,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:10,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 22:12:10,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:10,936 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 22:12:10,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:10,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 22:12:10,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376026073] [2020-11-29 22:12:10,937 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:10,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:10,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2020-11-29 22:12:10,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:10,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967058934] [2020-11-29 22:12:10,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:10,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:10,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:10,957 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:10,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:12:10,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:12:10,996 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-11-29 22:12:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:11,034 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-11-29 22:12:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 22:12:11,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-11-29 22:12:11,035 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:11,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2020-11-29 22:12:11,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:11,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:11,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-11-29 22:12:11,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:11,037 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-11-29 22:12:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-11-29 22:12:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-11-29 22:12:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-29 22:12:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-11-29 22:12:11,039 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-11-29 22:12:11,039 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-11-29 22:12:11,039 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 22:12:11,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2020-11-29 22:12:11,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:11,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:11,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:11,040 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-11-29 22:12:11,040 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:11,040 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 357#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 358#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 359#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 360#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 361#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 369#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 368#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 367#L34-3 assume !(main_~i~1 < 10); 356#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 349#L20-3 [2020-11-29 22:12:11,040 INFO L796 eck$LassoCheckResult]: Loop: 349#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 350#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 349#L20-3 [2020-11-29 22:12:11,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:11,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-11-29 22:12:11,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:11,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682508597] [2020-11-29 22:12:11,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:11,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682508597] [2020-11-29 22:12:11,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292556062] [2020-11-29 22:12:11,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:11,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-29 22:12:11,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:11,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 22:12:11,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:11,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:11,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 22:12:11,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892866909] [2020-11-29 22:12:11,168 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:11,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2020-11-29 22:12:11,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:11,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346170682] [2020-11-29 22:12:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:11,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:11,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:11,177 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:11,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:12:11,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:12:11,211 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-11-29 22:12:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:11,234 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-11-29 22:12:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:12:11,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2020-11-29 22:12:11,238 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:11,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2020-11-29 22:12:11,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:11,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:11,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2020-11-29 22:12:11,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:11,239 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-11-29 22:12:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2020-11-29 22:12:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-11-29 22:12:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-29 22:12:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-11-29 22:12:11,241 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-11-29 22:12:11,241 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-11-29 22:12:11,241 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 22:12:11,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2020-11-29 22:12:11,242 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:11,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:11,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:11,242 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-11-29 22:12:11,242 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:11,243 INFO L794 eck$LassoCheckResult]: Stem: 448#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 443#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 444#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 445#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 446#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 447#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 449#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 457#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 456#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 455#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 454#L34-3 assume !(main_~i~1 < 10); 442#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 435#L20-3 [2020-11-29 22:12:11,243 INFO L796 eck$LassoCheckResult]: Loop: 435#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 436#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 435#L20-3 [2020-11-29 22:12:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:11,243 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-11-29 22:12:11,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:11,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741069990] [2020-11-29 22:12:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:11,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741069990] [2020-11-29 22:12:11,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122719792] [2020-11-29 22:12:11,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:11,382 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 22:12:11,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:11,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 22:12:11,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:11,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:11,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 22:12:11,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923921850] [2020-11-29 22:12:11,418 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:11,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2020-11-29 22:12:11,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:11,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872166777] [2020-11-29 22:12:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:11,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:11,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:11,442 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:11,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:11,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:12:11,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:12:11,483 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-11-29 22:12:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:11,514 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-11-29 22:12:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:12:11,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2020-11-29 22:12:11,516 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:11,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2020-11-29 22:12:11,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:11,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:11,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2020-11-29 22:12:11,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:11,517 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-11-29 22:12:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2020-11-29 22:12:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-11-29 22:12:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-29 22:12:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-11-29 22:12:11,519 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-11-29 22:12:11,519 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-11-29 22:12:11,519 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 22:12:11,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-11-29 22:12:11,519 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:11,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:11,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:11,520 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-11-29 22:12:11,520 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:11,523 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 544#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 540#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 541#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 542#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 543#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 545#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 556#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 555#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 554#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 553#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 552#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 551#L34-3 assume !(main_~i~1 < 10); 539#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 532#L20-3 [2020-11-29 22:12:11,523 INFO L796 eck$LassoCheckResult]: Loop: 532#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 533#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 532#L20-3 [2020-11-29 22:12:11,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:11,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-11-29 22:12:11,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:11,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514374113] [2020-11-29 22:12:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:11,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514374113] [2020-11-29 22:12:11,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79335981] [2020-11-29 22:12:11,630 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:11,685 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-29 22:12:11,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:11,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 22:12:11,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:11,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:11,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-11-29 22:12:11,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425069983] [2020-11-29 22:12:11,719 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2020-11-29 22:12:11,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:11,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207035143] [2020-11-29 22:12:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:11,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:11,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:11,743 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:11,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 22:12:11,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:12:11,781 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 9 states. [2020-11-29 22:12:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:11,816 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-11-29 22:12:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 22:12:11,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2020-11-29 22:12:11,818 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:11,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2020-11-29 22:12:11,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:11,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:11,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2020-11-29 22:12:11,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:11,819 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-11-29 22:12:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2020-11-29 22:12:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-11-29 22:12:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-11-29 22:12:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-11-29 22:12:11,821 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-11-29 22:12:11,821 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-11-29 22:12:11,821 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 22:12:11,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2020-11-29 22:12:11,822 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:11,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:11,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:11,823 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-11-29 22:12:11,823 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:11,823 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 648#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 649#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 650#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 651#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 652#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 654#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 666#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 665#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 664#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 663#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 662#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 661#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 660#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 659#L34-3 assume !(main_~i~1 < 10); 647#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 640#L20-3 [2020-11-29 22:12:11,823 INFO L796 eck$LassoCheckResult]: Loop: 640#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 641#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 640#L20-3 [2020-11-29 22:12:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-11-29 22:12:11,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:11,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376362660] [2020-11-29 22:12:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:11,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376362660] [2020-11-29 22:12:11,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111244057] [2020-11-29 22:12:11,924 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:11,994 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-11-29 22:12:11,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:11,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 22:12:11,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:12,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:12,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-29 22:12:12,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607872966] [2020-11-29 22:12:12,025 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:12,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 7 times [2020-11-29 22:12:12,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:12,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598632285] [2020-11-29 22:12:12,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:12,029 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:12,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:12,032 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:12,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 22:12:12,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:12:12,068 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-11-29 22:12:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:12,106 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-11-29 22:12:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 22:12:12,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2020-11-29 22:12:12,109 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:12,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2020-11-29 22:12:12,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:12,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:12,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2020-11-29 22:12:12,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:12,110 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-11-29 22:12:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2020-11-29 22:12:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-11-29 22:12:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-29 22:12:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-11-29 22:12:12,112 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-11-29 22:12:12,112 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-11-29 22:12:12,112 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 22:12:12,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2020-11-29 22:12:12,113 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:12,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:12,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:12,113 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-11-29 22:12:12,113 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:12,114 INFO L794 eck$LassoCheckResult]: Stem: 772#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 767#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 768#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 769#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 770#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 771#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 773#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 787#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 786#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 785#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 784#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 783#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 782#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 781#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 780#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 779#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 778#L34-3 assume !(main_~i~1 < 10); 766#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 759#L20-3 [2020-11-29 22:12:12,114 INFO L796 eck$LassoCheckResult]: Loop: 759#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 760#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 759#L20-3 [2020-11-29 22:12:12,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:12,114 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-11-29 22:12:12,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:12,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720255503] [2020-11-29 22:12:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:12,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720255503] [2020-11-29 22:12:12,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138620613] [2020-11-29 22:12:12,233 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:12,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 22:12:12,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:12,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:12,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-29 22:12:12,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564526220] [2020-11-29 22:12:12,319 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:12,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:12,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 8 times [2020-11-29 22:12:12,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:12,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248143311] [2020-11-29 22:12:12,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:12,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:12,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:12,330 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:12,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 22:12:12,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-29 22:12:12,365 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 9 Second operand 11 states. [2020-11-29 22:12:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:12,405 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-11-29 22:12:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 22:12:12,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2020-11-29 22:12:12,407 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:12,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 38 transitions. [2020-11-29 22:12:12,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:12,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:12,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2020-11-29 22:12:12,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:12,408 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-11-29 22:12:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2020-11-29 22:12:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-11-29 22:12:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-29 22:12:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-11-29 22:12:12,410 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-11-29 22:12:12,410 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-11-29 22:12:12,411 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 22:12:12,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2020-11-29 22:12:12,411 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:12,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:12,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:12,412 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-11-29 22:12:12,412 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:12,412 INFO L794 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 897#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 898#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 899#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 900#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 901#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 903#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 919#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 918#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 917#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 916#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 915#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 914#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 913#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 912#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 911#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 910#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 909#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 908#L34-3 assume !(main_~i~1 < 10); 896#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 889#L20-3 [2020-11-29 22:12:12,412 INFO L796 eck$LassoCheckResult]: Loop: 889#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 890#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 889#L20-3 [2020-11-29 22:12:12,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-11-29 22:12:12,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:12,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396481369] [2020-11-29 22:12:12,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:12,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396481369] [2020-11-29 22:12:12,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269370237] [2020-11-29 22:12:12,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:12,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:12:12,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:12,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 22:12:12,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:12,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:12,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-29 22:12:12,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48966232] [2020-11-29 22:12:12,722 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 9 times [2020-11-29 22:12:12,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:12,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825921805] [2020-11-29 22:12:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:12,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:12,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:12,729 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:12,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:12,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:12:12,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:12:12,761 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 12 states. [2020-11-29 22:12:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:12,804 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-11-29 22:12:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:12:12,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2020-11-29 22:12:12,806 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:12,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2020-11-29 22:12:12,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:12,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:12,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2020-11-29 22:12:12,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:12,807 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-11-29 22:12:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2020-11-29 22:12:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-11-29 22:12:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-29 22:12:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-11-29 22:12:12,809 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-11-29 22:12:12,810 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-11-29 22:12:12,810 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 22:12:12,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2020-11-29 22:12:12,810 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:12,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:12,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:12,811 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-11-29 22:12:12,811 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:12,811 INFO L794 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1038#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1039#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1040#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1041#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1042#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1044#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1062#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1061#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1060#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1059#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1058#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1057#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1056#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1055#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1054#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1053#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1052#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1051#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1050#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1049#L34-3 assume !(main_~i~1 < 10); 1037#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1030#L20-3 [2020-11-29 22:12:12,811 INFO L796 eck$LassoCheckResult]: Loop: 1030#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1031#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1030#L20-3 [2020-11-29 22:12:12,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:12,812 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-11-29 22:12:12,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:12,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730931007] [2020-11-29 22:12:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:12,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730931007] [2020-11-29 22:12:12,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387956450] [2020-11-29 22:12:12,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:13,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-11-29 22:12:13,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:13,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 22:12:13,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:12:13,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:13,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-11-29 22:12:13,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62951918] [2020-11-29 22:12:13,061 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 10 times [2020-11-29 22:12:13,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:13,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596099206] [2020-11-29 22:12:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:13,065 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:13,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:13,068 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:13,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 22:12:13,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-29 22:12:13,095 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 9 Second operand 13 states. [2020-11-29 22:12:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:13,144 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-11-29 22:12:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:12:13,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2020-11-29 22:12:13,145 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:13,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2020-11-29 22:12:13,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 22:12:13,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 22:12:13,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2020-11-29 22:12:13,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:13,146 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-29 22:12:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2020-11-29 22:12:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-29 22:12:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-29 22:12:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-29 22:12:13,149 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-29 22:12:13,149 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-29 22:12:13,149 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 22:12:13,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2020-11-29 22:12:13,150 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 22:12:13,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:13,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:13,150 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-11-29 22:12:13,150 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:13,151 INFO L794 eck$LassoCheckResult]: Stem: 1195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1193#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1189#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1190#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1191#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1192#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1194#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1215#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1214#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1213#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1212#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1211#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1210#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1209#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1208#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1207#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1206#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1205#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1204#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1203#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1202#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1201#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1200#L34-3 assume !(main_~i~1 < 10); 1188#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1181#L20-3 [2020-11-29 22:12:13,151 INFO L796 eck$LassoCheckResult]: Loop: 1181#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1182#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1181#L20-3 [2020-11-29 22:12:13,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-11-29 22:12:13,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:13,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097577816] [2020-11-29 22:12:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:13,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:13,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:13,182 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:13,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 11 times [2020-11-29 22:12:13,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:13,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917815852] [2020-11-29 22:12:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:13,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:13,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:13,188 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2020-11-29 22:12:13,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:13,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213666864] [2020-11-29 22:12:13,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:13,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:13,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:13,241 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:18,310 WARN L193 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 251 DAG size of output: 184 [2020-11-29 22:12:18,759 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 22:12:18,762 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 22:12:18,762 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 22:12:18,762 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 22:12:18,762 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 22:12:18,762 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 22:12:18,762 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:18,762 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 22:12:18,763 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 22:12:18,763 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration12_Lasso [2020-11-29 22:12:18,763 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 22:12:18,763 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 22:12:18,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:12:18,788 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 22:12:18,798 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 22:12:18,800 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 22:12:18,803 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 22:12:18,805 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 22:12:18,807 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 22:12:18,809 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 22:12:18,812 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 22:12:18,814 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 22:12:18,816 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 22:12:18,819 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 22:12:18,823 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 22:12:18,825 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 22:12:19,135 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-11-29 22:12:19,168 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 22:12:19,171 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 22:12:19,173 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 22:12:19,186 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 22:12:19,188 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 22:12:19,191 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 22:12:19,193 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 22:12:19,195 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 22:12:19,198 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 22:12:19,629 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 22:12:19,629 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:19,640 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 22:12:19,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:19,667 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 22:12:19,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:19,690 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 22:12:19,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:19,717 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 22:12:19,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:19,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:19,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:19,762 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 22:12:19,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:19,797 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 22:12:19,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:19,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:12:19,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:12:19,854 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 22:12:19,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:19,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:19,884 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 22:12:19,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:19,912 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 22:12:19,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:19,935 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 22:12:19,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:19,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:19,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:19,964 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 22:12:19,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:19,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:19,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:19,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:19,987 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 22:12:19,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:19,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:19,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:19,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:19,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:19,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:20,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:20,053 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 22:12:20,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:20,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:20,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:20,109 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 22:12:20,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:20,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:20,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_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:20,153 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 22:12:20,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:20,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:20,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:20,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:20,193 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 22:12:20,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:20,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:20,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:20,245 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 22:12:20,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:20,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:20,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:20,270 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 22:12:20,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:20,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:20,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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) [2020-11-29 22:12:20,320 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:20,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:20,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:20,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:20,349 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 22:12:20,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:20,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:20,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:20,375 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 22:12:20,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:12:20,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:12:20,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:12:20,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:20,406 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 22:12:20,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:20,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:20,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:20,434 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 22:12:20,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:12:20,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:12:20,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:12:20,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:12:20,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:12:20,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:12:20,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 22:12:20,492 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-11-29 22:12:20,493 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:12:20,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 22:12:20,497 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 22:12:20,497 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 22:12:20,497 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sum_~x.base)_1, ULTIMATE.start_sum_~i~0) = 19*v_rep(select #length ULTIMATE.start_sum_~x.base)_1 - 8*ULTIMATE.start_sum_~i~0 Supporting invariants [] [2020-11-29 22:12:20,542 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-11-29 22:12:20,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 22:12:20,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:20,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 22:12:20,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:20,598 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 22:12:20,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:20,614 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 22:12:20,614 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 22:12:20,615 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-11-29 22:12:20,641 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 41 states and 48 transitions. Complement of second has 7 states. [2020-11-29 22:12:20,643 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 22:12:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 22:12:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-11-29 22:12:20,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2020-11-29 22:12:20,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:12:20,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2020-11-29 22:12:20,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:12:20,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2020-11-29 22:12:20,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:12:20,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2020-11-29 22:12:20,646 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:20,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2020-11-29 22:12:20,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-29 22:12:20,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-29 22:12:20,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2020-11-29 22:12:20,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:20,649 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-11-29 22:12:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2020-11-29 22:12:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-11-29 22:12:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-29 22:12:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-11-29 22:12:20,652 INFO L714 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-11-29 22:12:20,652 INFO L594 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-11-29 22:12:20,652 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-29 22:12:20,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2020-11-29 22:12:20,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:20,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:20,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:20,653 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:20,653 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:20,654 INFO L794 eck$LassoCheckResult]: Stem: 1419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1414#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1415#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1416#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1417#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1418#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1420#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1440#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1439#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1438#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1437#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1436#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1435#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1434#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1433#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1432#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1431#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1430#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1429#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1428#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1427#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1426#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1425#L34-3 assume !(main_~i~1 < 10); 1413#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1405#L20-3 assume !(sum_~i~0 < 10); 1403#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1404#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1423#L20-8 [2020-11-29 22:12:20,654 INFO L796 eck$LassoCheckResult]: Loop: 1423#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1424#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1423#L20-8 [2020-11-29 22:12:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2020-11-29 22:12:20,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:20,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493639120] [2020-11-29 22:12:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:12:20,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493639120] [2020-11-29 22:12:20,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:12:20,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:12:20,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218296300] [2020-11-29 22:12:20,701 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2020-11-29 22:12:20,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:20,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383660451] [2020-11-29 22:12:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:20,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:20,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:20,707 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:20,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 22:12:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 22:12:20,745 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-11-29 22:12:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:20,772 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-11-29 22:12:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:12:20,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2020-11-29 22:12:20,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:20,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2020-11-29 22:12:20,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:12:20,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:12:20,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2020-11-29 22:12:20,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:20,775 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-11-29 22:12:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2020-11-29 22:12:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2020-11-29 22:12:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-29 22:12:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-29 22:12:20,777 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-29 22:12:20,777 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-29 22:12:20,777 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-29 22:12:20,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2020-11-29 22:12:20,777 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:20,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:20,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:20,778 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:20,778 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:20,778 INFO L794 eck$LassoCheckResult]: Stem: 1506#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1501#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1502#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1503#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1504#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1505#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1528#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1527#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1526#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1525#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1524#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1523#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1522#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1521#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1520#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1519#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1518#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1517#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1516#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1515#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1514#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1513#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1512#L34-3 assume !(main_~i~1 < 10); 1500#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1492#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1493#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1494#L20-3 assume !(sum_~i~0 < 10); 1490#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1491#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1509#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1510#L20-7 [2020-11-29 22:12:20,778 INFO L796 eck$LassoCheckResult]: Loop: 1510#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1511#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1510#L20-7 [2020-11-29 22:12:20,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:20,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2020-11-29 22:12:20,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:20,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238285150] [2020-11-29 22:12:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:12:20,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238285150] [2020-11-29 22:12:20,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706451838] [2020-11-29 22:12:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:20,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 22:12:20,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:12:20,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:20,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 22:12:20,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966856692] [2020-11-29 22:12:20,915 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2020-11-29 22:12:20,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:20,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876345752] [2020-11-29 22:12:20,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:20,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:20,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:20,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:20,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:12:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:12:20,971 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-11-29 22:12:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:21,025 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-11-29 22:12:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:12:21,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2020-11-29 22:12:21,026 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:21,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2020-11-29 22:12:21,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-11-29 22:12:21,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-11-29 22:12:21,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2020-11-29 22:12:21,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:21,028 INFO L691 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-11-29 22:12:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2020-11-29 22:12:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-11-29 22:12:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-29 22:12:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-11-29 22:12:21,030 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-11-29 22:12:21,030 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-11-29 22:12:21,030 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-11-29 22:12:21,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2020-11-29 22:12:21,031 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:21,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:21,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:21,032 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:21,032 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:21,032 INFO L794 eck$LassoCheckResult]: Stem: 1690#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1685#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1686#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1687#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1688#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1689#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1715#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1714#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1713#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1712#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1711#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1710#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1709#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1708#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1707#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1706#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1705#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1704#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1703#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1702#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1701#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1700#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1699#L34-3 assume !(main_~i~1 < 10); 1684#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1675#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1676#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1677#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1678#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1696#L20-3 assume !(sum_~i~0 < 10); 1673#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1674#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1693#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1694#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1695#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1698#L20-7 [2020-11-29 22:12:21,032 INFO L796 eck$LassoCheckResult]: Loop: 1698#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1697#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1698#L20-7 [2020-11-29 22:12:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:21,036 INFO L82 PathProgramCache]: Analyzing trace with hash 528482161, now seen corresponding path program 1 times [2020-11-29 22:12:21,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:21,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516543469] [2020-11-29 22:12:21,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-11-29 22:12:21,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516543469] [2020-11-29 22:12:21,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14531215] [2020-11-29 22:12:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:21,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 22:12:21,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-11-29 22:12:21,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:21,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 22:12:21,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051440087] [2020-11-29 22:12:21,183 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2020-11-29 22:12:21,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:21,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148007173] [2020-11-29 22:12:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:21,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:21,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:21,190 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:21,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:21,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:12:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:12:21,223 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-11-29 22:12:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:21,281 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-11-29 22:12:21,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 22:12:21,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 59 transitions. [2020-11-29 22:12:21,283 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:21,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 59 transitions. [2020-11-29 22:12:21,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-29 22:12:21,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-11-29 22:12:21,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2020-11-29 22:12:21,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:21,285 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-11-29 22:12:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2020-11-29 22:12:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2020-11-29 22:12:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-29 22:12:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-11-29 22:12:21,287 INFO L714 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-11-29 22:12:21,287 INFO L594 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-11-29 22:12:21,287 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-11-29 22:12:21,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 51 transitions. [2020-11-29 22:12:21,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:21,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:21,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:21,291 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:21,296 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:21,297 INFO L794 eck$LassoCheckResult]: Stem: 1897#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1892#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1893#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1894#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1895#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1896#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1924#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1923#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1922#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1921#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1920#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1919#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1918#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1917#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1916#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1915#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1914#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1913#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1912#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1911#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1910#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1909#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1908#L34-3 assume !(main_~i~1 < 10); 1891#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1881#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1882#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1883#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1884#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1888#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1905#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1904#L20-3 assume !(sum_~i~0 < 10); 1879#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1880#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1902#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1903#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1900#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1901#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1925#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1907#L20-7 [2020-11-29 22:12:21,297 INFO L796 eck$LassoCheckResult]: Loop: 1907#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1906#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1907#L20-7 [2020-11-29 22:12:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:21,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1101320015, now seen corresponding path program 2 times [2020-11-29 22:12:21,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:21,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781174442] [2020-11-29 22:12:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-29 22:12:21,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781174442] [2020-11-29 22:12:21,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446445720] [2020-11-29 22:12:21,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:21,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:12:21,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:21,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 22:12:21,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-29 22:12:21,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:21,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 22:12:21,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897524073] [2020-11-29 22:12:21,476 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2020-11-29 22:12:21,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:21,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837125192] [2020-11-29 22:12:21,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:21,478 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:21,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:21,481 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:21,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:21,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:12:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:12:21,520 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-11-29 22:12:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:21,589 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2020-11-29 22:12:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:12:21,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2020-11-29 22:12:21,590 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:21,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 65 transitions. [2020-11-29 22:12:21,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-11-29 22:12:21,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-11-29 22:12:21,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2020-11-29 22:12:21,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:21,591 INFO L691 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2020-11-29 22:12:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2020-11-29 22:12:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2020-11-29 22:12:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-29 22:12:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-11-29 22:12:21,595 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-11-29 22:12:21,595 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-11-29 22:12:21,595 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-11-29 22:12:21,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2020-11-29 22:12:21,595 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:21,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:21,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:21,596 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:21,596 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:21,597 INFO L794 eck$LassoCheckResult]: Stem: 2126#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2121#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2122#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2123#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2124#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2125#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2152#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2151#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2150#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2149#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2148#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2147#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2146#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2145#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2144#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2143#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2142#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2141#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2140#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2139#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2138#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2137#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2136#L34-3 assume !(main_~i~1 < 10); 2120#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2110#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2111#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2112#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2113#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2117#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2154#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2153#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2133#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2132#L20-3 assume !(sum_~i~0 < 10); 2108#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2109#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2129#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2130#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2131#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2158#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2157#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2156#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2155#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2135#L20-7 [2020-11-29 22:12:21,597 INFO L796 eck$LassoCheckResult]: Loop: 2135#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2134#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2135#L20-7 [2020-11-29 22:12:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 3 times [2020-11-29 22:12:21,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:21,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836981178] [2020-11-29 22:12:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 22:12:21,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836981178] [2020-11-29 22:12:21,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098635354] [2020-11-29 22:12:21,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:21,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-29 22:12:21,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:21,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 22:12:21,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 22:12:21,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:21,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 22:12:21,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493522622] [2020-11-29 22:12:21,772 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2020-11-29 22:12:21,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:21,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132046412] [2020-11-29 22:12:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:21,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:21,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:21,777 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:21,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:21,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:12:21,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:12:21,815 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-11-29 22:12:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:21,921 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-11-29 22:12:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:12:21,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 71 transitions. [2020-11-29 22:12:21,923 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:21,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 71 transitions. [2020-11-29 22:12:21,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-11-29 22:12:21,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-11-29 22:12:21,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2020-11-29 22:12:21,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:21,924 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-11-29 22:12:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2020-11-29 22:12:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-11-29 22:12:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-29 22:12:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-11-29 22:12:21,928 INFO L714 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-11-29 22:12:21,928 INFO L594 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-11-29 22:12:21,928 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-11-29 22:12:21,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 59 transitions. [2020-11-29 22:12:21,928 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:21,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:21,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:21,932 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:21,932 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:21,932 INFO L794 eck$LassoCheckResult]: Stem: 2378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2377#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2373#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2374#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2375#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2376#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2404#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2403#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2402#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2401#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2400#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2399#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2398#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2397#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2396#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2395#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2394#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2393#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2392#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2391#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2390#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2389#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2388#L34-3 assume !(main_~i~1 < 10); 2372#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2362#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2363#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2364#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2365#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2369#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2408#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2407#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2406#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2405#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2385#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2384#L20-3 assume !(sum_~i~0 < 10); 2360#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2361#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2381#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2382#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2383#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2414#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2413#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2412#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2411#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2410#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2409#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2387#L20-7 [2020-11-29 22:12:21,933 INFO L796 eck$LassoCheckResult]: Loop: 2387#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2386#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2387#L20-7 [2020-11-29 22:12:21,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:21,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1883803697, now seen corresponding path program 4 times [2020-11-29 22:12:21,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:21,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955650362] [2020-11-29 22:12:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-11-29 22:12:22,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955650362] [2020-11-29 22:12:22,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898174710] [2020-11-29 22:12:22,007 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:22,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 22:12:22,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:22,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 22:12:22,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-11-29 22:12:22,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:22,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-11-29 22:12:22,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713517261] [2020-11-29 22:12:22,135 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:22,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2020-11-29 22:12:22,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:22,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635411123] [2020-11-29 22:12:22,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:22,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:22,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:22,142 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:22,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:22,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 22:12:22,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:12:22,174 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. cyclomatic complexity: 9 Second operand 9 states. [2020-11-29 22:12:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:22,266 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2020-11-29 22:12:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 22:12:22,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 77 transitions. [2020-11-29 22:12:22,267 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:22,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 77 transitions. [2020-11-29 22:12:22,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2020-11-29 22:12:22,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-11-29 22:12:22,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 77 transitions. [2020-11-29 22:12:22,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:22,268 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2020-11-29 22:12:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 77 transitions. [2020-11-29 22:12:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2020-11-29 22:12:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-29 22:12:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-11-29 22:12:22,271 INFO L714 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-11-29 22:12:22,271 INFO L594 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-11-29 22:12:22,272 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-11-29 22:12:22,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2020-11-29 22:12:22,272 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:22,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:22,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:22,273 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:22,273 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:22,273 INFO L794 eck$LassoCheckResult]: Stem: 2652#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2647#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2648#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2649#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2650#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2651#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2678#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2677#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2676#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2675#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2674#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2673#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2672#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2671#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2670#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2669#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2668#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2667#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2666#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2665#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2664#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2663#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2662#L34-3 assume !(main_~i~1 < 10); 2646#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2637#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2638#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2639#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2640#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2685#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2684#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2683#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2682#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2681#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2680#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2679#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2659#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2658#L20-3 assume !(sum_~i~0 < 10); 2635#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2636#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2655#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2656#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2657#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2693#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2692#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2691#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2690#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2689#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2688#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2687#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2686#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2661#L20-7 [2020-11-29 22:12:22,273 INFO L796 eck$LassoCheckResult]: Loop: 2661#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2660#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2661#L20-7 [2020-11-29 22:12:22,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash -414957967, now seen corresponding path program 5 times [2020-11-29 22:12:22,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:22,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891082561] [2020-11-29 22:12:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2020-11-29 22:12:22,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891082561] [2020-11-29 22:12:22,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227522236] [2020-11-29 22:12:22,389 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:22,522 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-11-29 22:12:22,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:22,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 22:12:22,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2020-11-29 22:12:22,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:22,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-29 22:12:22,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076922112] [2020-11-29 22:12:22,540 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 7 times [2020-11-29 22:12:22,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:22,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461707520] [2020-11-29 22:12:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:22,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:22,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:22,555 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:22,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 22:12:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:12:22,595 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-11-29 22:12:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:22,714 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-11-29 22:12:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 22:12:22,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 83 transitions. [2020-11-29 22:12:22,716 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:22,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 83 transitions. [2020-11-29 22:12:22,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-11-29 22:12:22,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-11-29 22:12:22,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 83 transitions. [2020-11-29 22:12:22,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:22,717 INFO L691 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-11-29 22:12:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 83 transitions. [2020-11-29 22:12:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2020-11-29 22:12:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-29 22:12:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-11-29 22:12:22,720 INFO L714 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-11-29 22:12:22,728 INFO L594 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-11-29 22:12:22,728 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-11-29 22:12:22,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 67 transitions. [2020-11-29 22:12:22,729 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:22,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:22,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:22,730 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:22,731 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:22,732 INFO L794 eck$LassoCheckResult]: Stem: 2950#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2945#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2946#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2947#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2948#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2949#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2976#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2975#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2974#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2973#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2972#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2971#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2970#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2969#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2968#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2967#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2966#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2965#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2964#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2963#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2962#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2961#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2960#L34-3 assume !(main_~i~1 < 10); 2944#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2935#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2936#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2937#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2938#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2985#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2984#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2983#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2982#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2981#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2980#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2979#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2978#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2977#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2957#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2956#L20-3 assume !(sum_~i~0 < 10); 2933#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2934#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2953#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2954#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2955#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2995#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2994#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2993#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2992#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2991#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2990#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2989#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2988#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2987#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2986#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2959#L20-7 [2020-11-29 22:12:22,733 INFO L796 eck$LassoCheckResult]: Loop: 2959#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2958#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2959#L20-7 [2020-11-29 22:12:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:22,733 INFO L82 PathProgramCache]: Analyzing trace with hash 919530417, now seen corresponding path program 6 times [2020-11-29 22:12:22,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:22,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146568211] [2020-11-29 22:12:22,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-29 22:12:22,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146568211] [2020-11-29 22:12:22,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103881251] [2020-11-29 22:12:22,864 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:23,256 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2020-11-29 22:12:23,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:23,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 22:12:23,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-29 22:12:23,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:23,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-29 22:12:23,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334185934] [2020-11-29 22:12:23,285 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:23,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 8 times [2020-11-29 22:12:23,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:23,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363297858] [2020-11-29 22:12:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:23,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:23,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:23,290 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:23,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 22:12:23,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-29 22:12:23,335 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. cyclomatic complexity: 9 Second operand 11 states. [2020-11-29 22:12:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:23,442 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2020-11-29 22:12:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 22:12:23,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 89 transitions. [2020-11-29 22:12:23,443 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:23,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 89 transitions. [2020-11-29 22:12:23,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2020-11-29 22:12:23,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2020-11-29 22:12:23,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 89 transitions. [2020-11-29 22:12:23,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:23,444 INFO L691 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2020-11-29 22:12:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 89 transitions. [2020-11-29 22:12:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2020-11-29 22:12:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-29 22:12:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2020-11-29 22:12:23,447 INFO L714 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-11-29 22:12:23,447 INFO L594 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-11-29 22:12:23,447 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-11-29 22:12:23,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 71 transitions. [2020-11-29 22:12:23,448 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:23,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:23,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:23,449 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:23,449 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:23,449 INFO L794 eck$LassoCheckResult]: Stem: 3271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 3266#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3267#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3268#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3269#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3270#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3298#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3297#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3296#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3295#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3294#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3293#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3292#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3291#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3290#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3289#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3288#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3287#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3286#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3285#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3284#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3283#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3282#L34-3 assume !(main_~i~1 < 10); 3265#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3256#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3257#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3258#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3259#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3320#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3319#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3317#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3315#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3313#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3311#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3309#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3307#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3305#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3303#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3301#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3279#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3278#L20-3 assume !(sum_~i~0 < 10); 3254#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3255#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3276#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3277#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3274#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3275#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3318#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3316#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3314#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3312#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3310#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3308#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3306#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3304#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3302#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3300#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3299#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3281#L20-7 [2020-11-29 22:12:23,450 INFO L796 eck$LassoCheckResult]: Loop: 3281#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3280#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3281#L20-7 [2020-11-29 22:12:23,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash 231036913, now seen corresponding path program 7 times [2020-11-29 22:12:23,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:23,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937067587] [2020-11-29 22:12:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2020-11-29 22:12:23,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937067587] [2020-11-29 22:12:23,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60916624] [2020-11-29 22:12:23,571 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:12:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:23,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 22:12:23,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2020-11-29 22:12:23,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:23,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-29 22:12:23,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531846052] [2020-11-29 22:12:23,688 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:23,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:23,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 9 times [2020-11-29 22:12:23,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:23,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652846830] [2020-11-29 22:12:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:23,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:23,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:23,695 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:23,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:23,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:12:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:12:23,731 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. cyclomatic complexity: 9 Second operand 12 states. [2020-11-29 22:12:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:23,891 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2020-11-29 22:12:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:12:23,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2020-11-29 22:12:23,893 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:23,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 95 transitions. [2020-11-29 22:12:23,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-11-29 22:12:23,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-11-29 22:12:23,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 95 transitions. [2020-11-29 22:12:23,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:23,894 INFO L691 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2020-11-29 22:12:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 95 transitions. [2020-11-29 22:12:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2020-11-29 22:12:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-29 22:12:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2020-11-29 22:12:23,897 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2020-11-29 22:12:23,897 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2020-11-29 22:12:23,897 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-11-29 22:12:23,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 75 transitions. [2020-11-29 22:12:23,898 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:23,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:23,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:23,899 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:23,899 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:23,899 INFO L794 eck$LassoCheckResult]: Stem: 3615#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 3610#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3611#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3612#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3613#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3614#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3642#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3641#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3640#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3639#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3638#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3637#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3636#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3635#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3634#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3633#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3632#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3631#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3630#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3629#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3628#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3627#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3626#L34-3 assume !(main_~i~1 < 10); 3609#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3600#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3601#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3602#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3603#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3668#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3667#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3665#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3663#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3661#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3659#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3657#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3655#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3653#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3651#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3649#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3647#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3645#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3623#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3622#L20-3 assume !(sum_~i~0 < 10); 3598#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3599#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3620#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3621#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3618#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3619#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3666#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3664#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3662#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3660#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3658#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3656#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3654#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3652#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3650#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3648#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3646#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3644#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3643#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3625#L20-7 [2020-11-29 22:12:23,900 INFO L796 eck$LassoCheckResult]: Loop: 3625#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3624#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3625#L20-7 [2020-11-29 22:12:23,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:23,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1835777231, now seen corresponding path program 8 times [2020-11-29 22:12:23,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:23,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593701438] [2020-11-29 22:12:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-11-29 22:12:24,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593701438] [2020-11-29 22:12:24,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730402044] [2020-11-29 22:12:24,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:24,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:12:24,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:24,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 22:12:24,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-11-29 22:12:24,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:12:24,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-11-29 22:12:24,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486176335] [2020-11-29 22:12:24,170 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:12:24,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:24,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 10 times [2020-11-29 22:12:24,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:24,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232521932] [2020-11-29 22:12:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:24,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:24,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:24,175 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:24,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:24,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 22:12:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-29 22:12:24,209 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. cyclomatic complexity: 9 Second operand 13 states. [2020-11-29 22:12:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:24,379 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2020-11-29 22:12:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:12:24,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2020-11-29 22:12:24,381 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:24,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2020-11-29 22:12:24,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-11-29 22:12:24,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-11-29 22:12:24,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2020-11-29 22:12:24,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:24,382 INFO L691 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2020-11-29 22:12:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2020-11-29 22:12:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2020-11-29 22:12:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-29 22:12:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2020-11-29 22:12:24,384 INFO L714 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2020-11-29 22:12:24,384 INFO L594 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2020-11-29 22:12:24,384 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-11-29 22:12:24,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2020-11-29 22:12:24,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 22:12:24,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:24,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:24,386 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:24,386 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:24,386 INFO L794 eck$LassoCheckResult]: Stem: 3979#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 3974#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3975#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3976#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3977#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3978#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4020#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4018#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4016#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4014#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4012#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4010#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4008#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4006#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4004#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4002#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4000#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3998#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3996#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3994#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3992#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3990#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3989#L34-3 assume !(main_~i~1 < 10); 3973#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3964#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3965#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3966#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3967#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4036#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4035#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4034#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4033#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4032#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4031#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4030#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4029#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4028#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4027#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4026#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4025#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4024#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4023#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4022#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3986#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3985#L20-3 assume !(sum_~i~0 < 10); 3962#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3963#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3982#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3983#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3984#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4021#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4019#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4017#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4015#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4013#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4011#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4009#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4007#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4005#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4003#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4001#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3999#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3997#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3995#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3993#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3991#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3988#L20-7 [2020-11-29 22:12:24,386 INFO L796 eck$LassoCheckResult]: Loop: 3988#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3987#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3988#L20-7 [2020-11-29 22:12:24,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 9 times [2020-11-29 22:12:24,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:24,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684744946] [2020-11-29 22:12:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:24,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:24,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:24,651 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:24,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 11 times [2020-11-29 22:12:24,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:24,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320913322] [2020-11-29 22:12:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:24,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:24,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:24,657 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 10 times [2020-11-29 22:12:24,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:24,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253042514] [2020-11-29 22:12:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:12:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2020-11-29 22:12:24,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253042514] [2020-11-29 22:12:24,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177355581] [2020-11-29 22:12:24,835 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/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 22:12:24,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 22:12:24,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:12:24,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-29 22:12:24,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:12:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2020-11-29 22:12:24,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 22:12:24,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2020-11-29 22:12:24,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294929190] [2020-11-29 22:12:24,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:12:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 22:12:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-11-29 22:12:24,982 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand 13 states. [2020-11-29 22:12:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:12:25,162 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-11-29 22:12:25,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 22:12:25,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2020-11-29 22:12:25,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 22:12:25,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2020-11-29 22:12:25,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-11-29 22:12:25,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-11-29 22:12:25,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2020-11-29 22:12:25,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:12:25,165 INFO L691 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-29 22:12:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2020-11-29 22:12:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-29 22:12:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-29 22:12:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-29 22:12:25,167 INFO L714 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-29 22:12:25,167 INFO L594 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-29 22:12:25,167 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-11-29 22:12:25,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2020-11-29 22:12:25,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 22:12:25,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:12:25,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:12:25,174 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:12:25,174 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:12:25,174 INFO L794 eck$LassoCheckResult]: Stem: 4364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 4359#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4360#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4361#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4362#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4363#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4405#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4404#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4402#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4400#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4398#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4396#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4394#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4392#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4390#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4388#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4386#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4384#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4382#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4380#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4378#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4375#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4374#L34-3 assume !(main_~i~1 < 10); 4358#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4353#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4354#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4355#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4403#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4401#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4399#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4397#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4395#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4393#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4391#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4389#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4387#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4385#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4383#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4381#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4379#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4377#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4376#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4373#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4372#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4371#L20-3 assume !(sum_~i~0 < 10); 4351#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4352#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4369#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4370#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4367#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4368#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4422#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4421#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4420#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4419#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4418#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4417#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4416#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4415#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4414#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4413#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4412#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4411#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4410#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4409#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4408#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4407#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4406#L20-8 assume !(sum_~i~0 < 10); 4365#L20-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4366#L23-1 main_#t~ret10 := sum_#res;main_~ret2~0 := main_#t~ret10;havoc main_#t~ret10;call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~2 := 0; 4356#L43-3 [2020-11-29 22:12:25,175 INFO L796 eck$LassoCheckResult]: Loop: 4356#L43-3 assume !!(main_~i~2 < 9);call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem13, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem13; 4357#L43-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 4356#L43-3 [2020-11-29 22:12:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:25,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2020-11-29 22:12:25,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:25,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344118495] [2020-11-29 22:12:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:25,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:25,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:25,350 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2020-11-29 22:12:25,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:25,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892356101] [2020-11-29 22:12:25,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:25,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:25,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:25,359 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:12:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:12:25,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2020-11-29 22:12:25,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:12:25,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265419444] [2020-11-29 22:12:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:12:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:25,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:12:25,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:12:25,667 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:13:56,535 WARN L193 SmtUtils]: Spent 1.51 m on a formula simplification. DAG size of input: 617 DAG size of output: 426 [2020-11-29 22:13:56,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:14:10,176 WARN L193 SmtUtils]: Spent 13.42 s on a formula simplification. DAG size of input: 380 DAG size of output: 264 [2020-11-29 22:14:10,207 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 22:14:10,207 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 22:14:10,207 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 22:14:10,207 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 22:14:10,207 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 22:14:10,207 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:14:10,207 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 22:14:10,207 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 22:14:10,207 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration24_Lasso [2020-11-29 22:14:10,207 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 22:14:10,208 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 22:14:10,226 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 22:14:10,230 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 22:14:10,234 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 22:14:10,240 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 22:14:10,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:14:10,248 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 22:14:10,252 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 22:14:10,255 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 22:14:10,259 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 22:14:10,264 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 22:14:10,269 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 22:14:10,273 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 22:14:10,277 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 22:14:10,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 22:15:11,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2020-11-29 22:15:12,679 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 163 DAG size of output: 139 [2020-11-29 22:15:13,089 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2020-11-29 22:15:13,090 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 22:15:13,095 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 22:15:13,100 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 22:15:13,105 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 22:15:15,694 WARN L193 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 170 DAG size of output: 148 [2020-11-29 22:15:15,816 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-11-29 22:15:15,927 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-11-29 22:15:19,137 WARN L193 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-11-29 22:15:19,282 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 22:15:19,283 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,298 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 22:15:19,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:15:19,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:15:19,341 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 22:15:19,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,365 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 22:15:19,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:19,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:15:19,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,405 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 22:15:19,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:15:19,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,432 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 22:15:19,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:15:19,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,457 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 22:15:19,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:15:19,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,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 22:15:19,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:15:19,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,505 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 22:15:19,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:15:19,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:15:19,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:19,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:15:19,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:15:19,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:19,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:15:19,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:15:19,604 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 22:15:19,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:15:19,644 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 22:15:19,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,686 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 22:15:19,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:15:19,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:15:19,729 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 22:15:19,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:19,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:15:19,773 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 22:15:19,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:15:19,815 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 22:15:19,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:19,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:15:19,857 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 22:15:19,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:19,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:15:19,899 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 22:15:19,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:19,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,945 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 22:15:19,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:19,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:19,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:15:19,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,969 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 22:15:19,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:19,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:19,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:19,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:19,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:19,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:15:19,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:19,998 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 22:15:20,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:20,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:20,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:20,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:20,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:20,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:15:20,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:20,025 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 22:15:20,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:20,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:15:20,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:20,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:20,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:20,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:15:20,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:15:20,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:15:20,049 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:20,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:20,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:15:20,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:20,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:20,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:15:20,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:15:20,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:20,077 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 22:15:20,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:15:20,080 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-11-29 22:15:20,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:15:20,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:15:20,119 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-11-29 22:15:20,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:15:20,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 22:15:20,258 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-11-29 22:15:20,259 INFO L444 ModelExtractionUtils]: 51 out of 85 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ece0d86-bdde-4598-8816-7dedc5a9c767/bin/uautomizer/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:15:20,265 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 22:15:20,267 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 22:15:20,267 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 22:15:20,268 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 17 Supporting invariants [] [2020-11-29 22:15:21,600 INFO L297 tatePredicateManager]: 166 out of 166 supporting invariants were superfluous and have been removed [2020-11-29 22:15:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:15:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:15:21,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 22:15:21,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:15:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:15:21,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 22:15:21,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:15:21,719 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 22:15:21,720 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 22:15:21,720 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-11-29 22:15:21,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 74 states and 76 transitions. Complement of second has 4 states. [2020-11-29 22:15:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 22:15:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 22:15:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-11-29 22:15:21,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 2 letters. [2020-11-29 22:15:21,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:15:21,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 72 letters. Loop has 2 letters. [2020-11-29 22:15:21,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:15:21,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 4 letters. [2020-11-29 22:15:21,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:15:21,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 76 transitions. [2020-11-29 22:15:21,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 22:15:21,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2020-11-29 22:15:21,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 22:15:21,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 22:15:21,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 22:15:21,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:15:21,746 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 22:15:21,746 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 22:15:21,746 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 22:15:21,746 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-11-29 22:15:21,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 22:15:21,747 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 22:15:21,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 22:15:21,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 10:15:21 BoogieIcfgContainer [2020-11-29 22:15:21,752 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 22:15:21,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 22:15:21,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 22:15:21,752 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 22:15:21,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:12:07" (3/4) ... [2020-11-29 22:15:21,755 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 22:15:21,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 22:15:21,756 INFO L168 Benchmark]: Toolchain (without parser) took 195164.98 ms. Allocated memory was 111.1 MB in the beginning and 234.9 MB in the end (delta: 123.7 MB). Free memory was 80.9 MB in the beginning and 140.1 MB in the end (delta: -59.2 MB). Peak memory consumption was 64.7 MB. Max. memory is 16.1 GB. [2020-11-29 22:15:21,756 INFO L168 Benchmark]: CDTParser took 1.26 ms. Allocated memory is still 75.5 MB. Free memory was 37.6 MB in the beginning and 37.5 MB in the end (delta: 33.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 22:15:21,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.48 ms. Allocated memory is still 111.1 MB. Free memory was 80.6 MB in the beginning and 88.0 MB in the end (delta: -7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 22:15:21,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.02 ms. Allocated memory is still 111.1 MB. Free memory was 88.0 MB in the beginning and 86.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 22:15:21,757 INFO L168 Benchmark]: Boogie Preprocessor took 25.40 ms. Allocated memory is still 111.1 MB. Free memory was 86.4 MB in the beginning and 84.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 22:15:21,758 INFO L168 Benchmark]: RCFGBuilder took 508.50 ms. Allocated memory is still 111.1 MB. Free memory was 84.7 MB in the beginning and 67.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-29 22:15:21,758 INFO L168 Benchmark]: BuchiAutomizer took 194319.22 ms. Allocated memory was 111.1 MB in the beginning and 234.9 MB in the end (delta: 123.7 MB). Free memory was 67.3 MB in the beginning and 141.2 MB in the end (delta: -73.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 16.1 GB. [2020-11-29 22:15:21,759 INFO L168 Benchmark]: Witness Printer took 3.14 ms. Allocated memory is still 234.9 MB. Free memory was 141.2 MB in the beginning and 140.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 22:15:21,760 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.26 ms. Allocated memory is still 75.5 MB. Free memory was 37.6 MB in the beginning and 37.5 MB in the end (delta: 33.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 265.48 ms. Allocated memory is still 111.1 MB. Free memory was 80.6 MB in the beginning and 88.0 MB in the end (delta: -7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.02 ms. Allocated memory is still 111.1 MB. Free memory was 88.0 MB in the beginning and 86.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.40 ms. Allocated memory is still 111.1 MB. Free memory was 86.4 MB in the beginning and 84.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 508.50 ms. Allocated memory is still 111.1 MB. Free memory was 84.7 MB in the beginning and 67.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 194319.22 ms. Allocated memory was 111.1 MB in the beginning and 234.9 MB in the end (delta: 123.7 MB). Free memory was 67.3 MB in the beginning and 141.2 MB in the end (delta: -73.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 16.1 GB. * Witness Printer took 3.14 ms. Allocated memory is still 234.9 MB. Free memory was 141.2 MB in the beginning and 140.1 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function 19 * unknown-#length-unknown[x] + -8 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 3 locations. 21 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 194.2s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 191.8s. Construction of modules took 1.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 136 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 75 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 413 SDtfs, 377 SDslu, 1226 SDs, 0 SdLazy, 861 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1366 mio100 ax100 hnf99 lsp237 ukn36 mio100 lsp83 div94 bol100 ite100 ukn100 eq161 hnf87 smp84 dnf151 smp84 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 192ms VariablesStem: 55 VariablesLoop: 11 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...