./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum05-2.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_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum05-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:20:20,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:20:20,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:20:20,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:20:20,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:20:20,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:20:20,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:20:20,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:20:20,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:20:20,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:20:20,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:20:20,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:20:20,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:20:20,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:20:20,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:20:20,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:20:20,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:20:20,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:20:20,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:20:20,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:20:20,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:20:20,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:20:20,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:20:20,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:20:20,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:20:20,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:20:20,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:20:20,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:20:20,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:20:20,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:20:20,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:20:20,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:20:20,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:20:20,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:20:20,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:20:20,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:20:20,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:20:20,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:20:20,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:20:20,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:20:20,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:20:20,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 18:20:20,334 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:20:20,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:20:20,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:20:20,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:20:20,336 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:20:20,336 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 18:20:20,337 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 18:20:20,337 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 18:20:20,337 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 18:20:20,337 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 18:20:20,338 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 18:20:20,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:20:20,338 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:20:20,338 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 18:20:20,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:20:20,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:20:20,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:20:20,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 18:20:20,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 18:20:20,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 18:20:20,339 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:20:20,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:20:20,339 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 18:20:20,340 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:20:20,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 18:20:20,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:20:20,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:20:20,340 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 18:20:20,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:20:20,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 18:20:20,341 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:20:20,341 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 18:20:20,342 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 18:20:20,342 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_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 -> eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa [2020-11-29 18:20:20,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:20:20,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:20:20,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:20:20,671 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:20:20,672 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:20:20,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum05-2.i [2020-11-29 18:20:20,755 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/data/50d7f9663/791280a7b9674a5a9ca18b087862c9b3/FLAGc3f029ae1 [2020-11-29 18:20:21,232 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:20:21,233 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/sv-benchmarks/c/reducercommutativity/sum05-2.i [2020-11-29 18:20:21,239 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/data/50d7f9663/791280a7b9674a5a9ca18b087862c9b3/FLAGc3f029ae1 [2020-11-29 18:20:21,596 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/data/50d7f9663/791280a7b9674a5a9ca18b087862c9b3 [2020-11-29 18:20:21,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:20:21,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:20:21,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:20:21,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:20:21,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:20:21,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:21,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50992208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21, skipping insertion in model container [2020-11-29 18:20:21,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:21,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:20:21,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:20:21,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:20:21,901 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:20:21,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:20:21,945 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:20:21,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21 WrapperNode [2020-11-29 18:20:21,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:20:21,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:20:21,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:20:21,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:20:21,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:21,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:21,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:20:21,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:20:21,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:20:21,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:20:22,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:22,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:22,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:22,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:22,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:22,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:22,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... [2020-11-29 18:20:22,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:20:22,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:20:22,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:20:22,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:20:22,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:20:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:20:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 18:20:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:20:22,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:20:22,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 18:20:22,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 18:20:22,517 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:20:22,518 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-11-29 18:20:22,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:20:22 BoogieIcfgContainer [2020-11-29 18:20:22,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:20:22,520 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 18:20:22,521 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 18:20:22,524 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 18:20:22,525 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 18:20:22,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 06:20:21" (1/3) ... [2020-11-29 18:20:22,526 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@308c253d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:20:22, skipping insertion in model container [2020-11-29 18:20:22,527 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 18:20:22,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:20:21" (2/3) ... [2020-11-29 18:20:22,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@308c253d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:20:22, skipping insertion in model container [2020-11-29 18:20:22,528 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 18:20:22,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:20:22" (3/3) ... [2020-11-29 18:20:22,529 INFO L373 chiAutomizerObserver]: Analyzing ICFG sum05-2.i [2020-11-29 18:20:22,579 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 18:20:22,580 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 18:20:22,580 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 18:20:22,580 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:20:22,580 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:20:22,589 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 18:20:22,590 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:20:22,590 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 18:20:22,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-11-29 18:20:22,640 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-11-29 18:20:22,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:22,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:22,645 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:20:22,645 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:22,646 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 18:20:22,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-11-29 18:20:22,648 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-11-29 18:20:22,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:22,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:22,649 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:20:22,649 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:22,655 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(20);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 18:20:22,655 INFO L796 eck$LassoCheckResult]: Loop: 9#L34-3true assume !!(main_~i~1 < 5);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 18:20:22,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:22,662 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 18:20:22,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:22,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576206714] [2020-11-29 18:20:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:22,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:22,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:22,804 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:22,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-29 18:20:22,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:22,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459076013] [2020-11-29 18:20:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:22,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:22,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:22,827 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-29 18:20:22,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:22,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863109951] [2020-11-29 18:20:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:22,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:22,872 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:22,878 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:23,223 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-11-29 18:20:23,344 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 18:20:23,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 18:20:23,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 18:20:23,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 18:20:23,346 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 18:20:23,346 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:23,346 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 18:20:23,346 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 18:20:23,346 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration1_Lasso [2020-11-29 18:20:23,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 18:20:23,347 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 18:20:23,379 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 18:20:23,387 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 18:20:23,390 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 18:20:23,393 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 18:20:23,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 18:20:23,404 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 18:20:23,409 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 18:20:23,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:20:23,416 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 18:20:23,428 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 18:20:23,601 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-11-29 18:20:23,650 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 18:20:23,654 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 18:20:23,658 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 18:20:23,661 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 18:20:23,664 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 18:20:23,672 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 18:20:23,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:20:23,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:20:23,683 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 18:20:24,009 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 18:20:24,013 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 18:20:24,020 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 18:20:24,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:24,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:24,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 18:20:24,078 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 18:20:24,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:24,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:24,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,125 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 18:20:24,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:24,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:24,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:24,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,165 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 18:20:24,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:24,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,217 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 18:20:24,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:24,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:24,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:24,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,268 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 18:20:24,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:24,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:24,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:24,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,309 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 18:20:24,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:24,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:24,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:24,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,345 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 18:20:24,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:24,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,407 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 18:20:24,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,418 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 18:20:24,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,465 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 18:20:24,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,471 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 18:20:24,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,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 18:20:24,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:24,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:24,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:24,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,546 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 18:20:24,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:24,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_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,590 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 18:20:24,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:24,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:24,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_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,706 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 18:20:24,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:24,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,751 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 18:20:24,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:24,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:24,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:24,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,783 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 18:20:24,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:24,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:24,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 18:20:24,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:24,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,893 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 18:20:24,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:24,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:24,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:24,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:24,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:24,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:24,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 18:20:24,950 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-11-29 18:20:24,950 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:24,983 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 18:20:24,986 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 18:20:24,986 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 18:20:24,987 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2020-11-29 18:20:25,047 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-11-29 18:20:25,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 18:20:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:25,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 18:20:25,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:25,117 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 18:20:25,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:25,159 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 18:20:25,178 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 18:20:25,180 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 3 states. [2020-11-29 18:20:25,280 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 18:20:25,281 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 18:20:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 18:20:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2020-11-29 18:20:25,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-29 18:20:25,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:20:25,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-29 18:20:25,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:20:25,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-29 18:20:25,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:20:25,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 97 transitions. [2020-11-29 18:20:25,292 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:25,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2020-11-29 18:20:25,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-11-29 18:20:25,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 18:20:25,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2020-11-29 18:20:25,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:25,299 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-29 18:20:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2020-11-29 18:20:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-11-29 18:20:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-29 18:20:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-11-29 18:20:25,326 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-29 18:20:25,326 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-29 18:20:25,327 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 18:20:25,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-11-29 18:20:25,328 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:25,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:25,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:25,328 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-29 18:20:25,329 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:25,329 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(20);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 < 5); 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 18:20:25,329 INFO L796 eck$LassoCheckResult]: Loop: 165#L20-3 assume !!(sum_~i~0 < 5);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 18:20:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:25,330 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-11-29 18:20:25,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:25,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104548280] [2020-11-29 18:20:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:25,405 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 18:20:25,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104548280] [2020-11-29 18:20:25,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:20:25,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:20:25,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293806839] [2020-11-29 18:20:25,409 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:25,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:25,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2020-11-29 18:20:25,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:25,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927197567] [2020-11-29 18:20:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:25,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:25,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:25,436 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:25,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:25,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:20:25,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:20:25,484 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-11-29 18:20:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:25,497 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-11-29 18:20:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:20:25,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2020-11-29 18:20:25,499 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:25,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2020-11-29 18:20:25,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 18:20:25,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 18:20:25,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2020-11-29 18:20:25,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:25,501 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-11-29 18:20:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2020-11-29 18:20:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-11-29 18:20:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-29 18:20:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-11-29 18:20:25,503 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-11-29 18:20:25,503 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-11-29 18:20:25,503 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 18:20:25,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2020-11-29 18:20:25,503 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:25,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:25,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:25,504 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-29 18:20:25,504 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:25,504 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(20);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 < 5);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 < 5); 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 18:20:25,505 INFO L796 eck$LassoCheckResult]: Loop: 210#L20-3 assume !!(sum_~i~0 < 5);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 18:20:25,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:25,505 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-11-29 18:20:25,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:25,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453615439] [2020-11-29 18:20:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:25,561 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 18:20:25,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453615439] [2020-11-29 18:20:25,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279287885] [2020-11-29 18:20:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:25,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:20:25,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:25,636 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 18:20:25,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:20:25,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 18:20:25,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704268271] [2020-11-29 18:20:25,637 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2020-11-29 18:20:25,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:25,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335242729] [2020-11-29 18:20:25,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:25,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:25,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:25,649 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:25,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:25,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:20:25,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:20:25,697 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-11-29 18:20:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:25,723 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-11-29 18:20:25,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:20:25,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2020-11-29 18:20:25,726 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:25,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2020-11-29 18:20:25,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 18:20:25,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 18:20:25,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2020-11-29 18:20:25,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:25,728 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-11-29 18:20:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2020-11-29 18:20:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-11-29 18:20:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-29 18:20:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-11-29 18:20:25,730 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-11-29 18:20:25,730 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-11-29 18:20:25,730 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 18:20:25,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2020-11-29 18:20:25,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:25,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:25,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:25,732 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-11-29 18:20:25,732 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:25,732 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(20);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 < 5);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 < 5);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 < 5); 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 18:20:25,732 INFO L796 eck$LassoCheckResult]: Loop: 274#L20-3 assume !!(sum_~i~0 < 5);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 18:20:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-11-29 18:20:25,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:25,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749242236] [2020-11-29 18:20:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:25,867 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 18:20:25,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749242236] [2020-11-29 18:20:25,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055903740] [2020-11-29 18:20:25,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:25,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 18:20:25,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:20:25,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 18:20:25,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:25,940 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 18:20:25,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:20:25,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 18:20:25,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395129939] [2020-11-29 18:20:25,941 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:25,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2020-11-29 18:20:25,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:25,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104768463] [2020-11-29 18:20:25,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:25,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:25,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:25,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:25,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:25,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:20:25,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:20:25,991 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-11-29 18:20:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:26,020 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-11-29 18:20:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:20:26,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-11-29 18:20:26,024 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:26,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2020-11-29 18:20:26,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 18:20:26,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 18:20:26,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-11-29 18:20:26,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:26,025 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-11-29 18:20:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-11-29 18:20:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-11-29 18:20:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-29 18:20:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-11-29 18:20:26,028 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-11-29 18:20:26,028 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-11-29 18:20:26,028 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 18:20:26,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2020-11-29 18:20:26,029 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:26,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:26,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:26,029 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-11-29 18:20:26,032 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:26,032 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(20);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 < 5);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 < 5);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 < 5);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 < 5); 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 18:20:26,032 INFO L796 eck$LassoCheckResult]: Loop: 349#L20-3 assume !!(sum_~i~0 < 5);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 18:20:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-11-29 18:20:26,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:26,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396719943] [2020-11-29 18:20:26,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:26,105 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 18:20:26,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396719943] [2020-11-29 18:20:26,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317461349] [2020-11-29 18:20:26,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:26,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-29 18:20:26,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:20:26,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 18:20:26,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:26,185 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 18:20:26,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:20:26,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 18:20:26,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652033273] [2020-11-29 18:20:26,186 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:26,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2020-11-29 18:20:26,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:26,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071286445] [2020-11-29 18:20:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,211 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:26,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:26,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:20:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:20:26,253 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-11-29 18:20:26,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:26,283 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-11-29 18:20:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:20:26,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2020-11-29 18:20:26,291 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:26,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2020-11-29 18:20:26,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 18:20:26,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 18:20:26,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2020-11-29 18:20:26,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:26,292 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-11-29 18:20:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2020-11-29 18:20:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-11-29 18:20:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-29 18:20:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-11-29 18:20:26,294 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-11-29 18:20:26,294 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-11-29 18:20:26,295 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 18:20:26,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2020-11-29 18:20:26,295 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:26,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:26,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:26,296 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-11-29 18:20:26,296 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:26,296 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(20);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 < 5);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 < 5);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 < 5);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 < 5);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 < 5); 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 18:20:26,296 INFO L796 eck$LassoCheckResult]: Loop: 435#L20-3 assume !!(sum_~i~0 < 5);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 18:20:26,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:26,297 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-11-29 18:20:26,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:26,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658954995] [2020-11-29 18:20:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:26,384 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 18:20:26,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658954995] [2020-11-29 18:20:26,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65254134] [2020-11-29 18:20:26,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:26,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 18:20:26,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:20:26,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 18:20:26,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:26,462 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 18:20:26,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:20:26,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 18:20:26,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765002358] [2020-11-29 18:20:26,463 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:26,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2020-11-29 18:20:26,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:26,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337788804] [2020-11-29 18:20:26,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,472 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:26,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:26,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 18:20:26,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:20:26,525 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-11-29 18:20:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:26,561 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-11-29 18:20:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:20:26,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2020-11-29 18:20:26,563 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:26,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2020-11-29 18:20:26,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 18:20:26,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 18:20:26,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2020-11-29 18:20:26,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:26,564 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-11-29 18:20:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2020-11-29 18:20:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-11-29 18:20:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-29 18:20:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-11-29 18:20:26,567 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-11-29 18:20:26,567 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-11-29 18:20:26,567 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 18:20:26,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-11-29 18:20:26,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-11-29 18:20:26,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:26,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:26,569 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-11-29 18:20:26,569 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:26,569 INFO L794 eck$LassoCheckResult]: Stem: 545#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); 543#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 539#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 540#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 541#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 542#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 544#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 555#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 554#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 553#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 552#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 551#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 550#L34-3 assume !(main_~i~1 < 5); 538#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; 531#L20-3 [2020-11-29 18:20:26,569 INFO L796 eck$LassoCheckResult]: Loop: 531#L20-3 assume !!(sum_~i~0 < 5);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; 532#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 531#L20-3 [2020-11-29 18:20:26,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-11-29 18:20:26,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:26,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407647398] [2020-11-29 18:20:26,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,637 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2020-11-29 18:20:26,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:26,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997682422] [2020-11-29 18:20:26,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,653 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:26,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2020-11-29 18:20:26,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:26,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851362120] [2020-11-29 18:20:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:26,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:26,735 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:27,895 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 167 DAG size of output: 127 [2020-11-29 18:20:28,111 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-29 18:20:28,115 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 18:20:28,115 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 18:20:28,115 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 18:20:28,115 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 18:20:28,115 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 18:20:28,115 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:28,115 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 18:20:28,116 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 18:20:28,116 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration7_Lasso [2020-11-29 18:20:28,116 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 18:20:28,116 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 18:20:28,119 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 18:20:28,146 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 18:20:28,149 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 18:20:28,164 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 18:20:28,167 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 18:20:28,170 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 18:20:28,466 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-11-29 18:20:28,496 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 18:20:28,498 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 18:20:28,506 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 18:20:28,509 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 18:20:28,512 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 18:20:28,515 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 18:20:28,518 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 18:20:28,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:20:28,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:20:28,530 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 18:20:28,534 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 18:20:28,538 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 18:20:28,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:20:28,546 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 18:20:28,550 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 18:20:28,552 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 18:20:28,554 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 18:20:28,980 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 18:20:28,981 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:28,989 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 18:20:28,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:28,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:28,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:28,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:28,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:28,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:28,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:28,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_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:29,027 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 18:20:29,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:29,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:29,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:29,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:29,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:29,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:29,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:29,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:29,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 18:20:29,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:29,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:29,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:29,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:29,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:29,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:29,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:29,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:29,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 18:20:29,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:29,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:20:29,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:29,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:29,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:29,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:20:29,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:20:29,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:20:29,118 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 18:20:29,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:29,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:29,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:29,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:29,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:29,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:29,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:29,167 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 18:20:29,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:29,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:29,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:29,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:29,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:29,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:29,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:29,196 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 18:20:29,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:20:29,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:20:29,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:20:29,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:20:29,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:20:29,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:20:29,219 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 18:20:29,242 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-11-29 18:20:29,242 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:20:29,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 18:20:29,246 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 18:20:29,246 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 18:20:29,246 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) = 9*v_rep(select #length ULTIMATE.start_sum_~x.base)_1 - 8*ULTIMATE.start_sum_~i~0 Supporting invariants [] [2020-11-29 18:20:29,367 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-11-29 18:20:29,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 18:20:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:29,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 18:20:29,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:29,429 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 18:20:29,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:29,459 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 18:20:29,459 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 18:20:29,459 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-11-29 18:20:29,507 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 7 states. [2020-11-29 18:20:29,509 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 18:20:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 18:20:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-11-29 18:20:29,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2020-11-29 18:20:29,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:20:29,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2020-11-29 18:20:29,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:20:29,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2020-11-29 18:20:29,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:20:29,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2020-11-29 18:20:29,512 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:29,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2020-11-29 18:20:29,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-29 18:20:29,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-29 18:20:29,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2020-11-29 18:20:29,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:29,513 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-11-29 18:20:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2020-11-29 18:20:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-11-29 18:20:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-29 18:20:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-11-29 18:20:29,516 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-11-29 18:20:29,516 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-11-29 18:20:29,516 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 18:20:29,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2020-11-29 18:20:29,516 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:29,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:29,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:29,517 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:20:29,517 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:29,524 INFO L794 eck$LassoCheckResult]: Stem: 719#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); 714#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 715#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 716#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 717#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 718#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 720#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 730#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 729#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 728#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 727#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 726#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 725#L34-3 assume !(main_~i~1 < 5); 713#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; 705#L20-3 assume !(sum_~i~0 < 5); 703#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 704#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; 723#L20-8 [2020-11-29 18:20:29,525 INFO L796 eck$LassoCheckResult]: Loop: 723#L20-8 assume !!(sum_~i~0 < 5);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; 724#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 723#L20-8 [2020-11-29 18:20:29,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:29,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2020-11-29 18:20:29,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:29,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824384325] [2020-11-29 18:20:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 18:20:29,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824384325] [2020-11-29 18:20:29,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:20:29,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:20:29,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673048251] [2020-11-29 18:20:29,585 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:29,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:29,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2020-11-29 18:20:29,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:29,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447971917] [2020-11-29 18:20:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:29,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:29,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:29,593 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:29,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:29,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:20:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:20:29,652 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-11-29 18:20:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:29,699 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-11-29 18:20:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:20:29,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2020-11-29 18:20:29,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:29,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2020-11-29 18:20:29,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 18:20:29,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 18:20:29,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2020-11-29 18:20:29,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:29,702 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-11-29 18:20:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2020-11-29 18:20:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2020-11-29 18:20:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-11-29 18:20:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-11-29 18:20:29,704 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-11-29 18:20:29,705 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-11-29 18:20:29,705 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 18:20:29,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2020-11-29 18:20:29,705 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:29,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:29,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:29,706 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:20:29,706 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:29,706 INFO L794 eck$LassoCheckResult]: Stem: 786#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); 781#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 782#L34-3 assume !!(main_~i~1 < 5);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; 784#L34-3 assume !!(main_~i~1 < 5);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; 798#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 797#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 796#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 795#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 794#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 793#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 792#L34-3 assume !(main_~i~1 < 5); 780#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; 772#L20-3 assume !!(sum_~i~0 < 5);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; 773#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 774#L20-3 assume !(sum_~i~0 < 5); 770#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 771#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; 789#L20-8 assume !!(sum_~i~0 < 5);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; 790#L20-7 [2020-11-29 18:20:29,706 INFO L796 eck$LassoCheckResult]: Loop: 790#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 791#L20-8 assume !!(sum_~i~0 < 5);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; 790#L20-7 [2020-11-29 18:20:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:29,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2020-11-29 18:20:29,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:29,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858028721] [2020-11-29 18:20:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 18:20:29,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858028721] [2020-11-29 18:20:29,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316718239] [2020-11-29 18:20:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:20:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:29,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:20:29,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 18:20:29,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:20:29,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 18:20:29,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17659117] [2020-11-29 18:20:29,876 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2020-11-29 18:20:29,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:29,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115197821] [2020-11-29 18:20:29,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:29,881 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:29,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:29,892 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:29,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:29,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:20:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:20:29,978 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-11-29 18:20:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:30,054 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-11-29 18:20:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:20:30,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2020-11-29 18:20:30,056 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:30,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2020-11-29 18:20:30,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-11-29 18:20:30,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-11-29 18:20:30,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2020-11-29 18:20:30,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:30,057 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-29 18:20:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2020-11-29 18:20:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2020-11-29 18:20:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-29 18:20:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-11-29 18:20:30,060 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-11-29 18:20:30,060 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-11-29 18:20:30,060 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 18:20:30,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2020-11-29 18:20:30,061 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:30,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:30,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:30,061 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:20:30,061 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:30,062 INFO L794 eck$LassoCheckResult]: Stem: 920#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); 915#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 916#L34-3 assume !!(main_~i~1 < 5);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; 918#L34-3 assume !!(main_~i~1 < 5);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; 935#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 934#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 933#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 932#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 931#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 930#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 929#L34-3 assume !(main_~i~1 < 5); 914#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; 905#L20-3 assume !!(sum_~i~0 < 5);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; 906#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 907#L20-3 assume !!(sum_~i~0 < 5);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; 908#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 927#L20-3 assume !(sum_~i~0 < 5); 903#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 904#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; 925#L20-8 assume !!(sum_~i~0 < 5);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; 926#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 923#L20-8 assume !!(sum_~i~0 < 5);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; 924#L20-7 [2020-11-29 18:20:30,062 INFO L796 eck$LassoCheckResult]: Loop: 924#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 928#L20-8 assume !!(sum_~i~0 < 5);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; 924#L20-7 [2020-11-29 18:20:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2020-11-29 18:20:30,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:30,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640307967] [2020-11-29 18:20:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 18:20:30,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640307967] [2020-11-29 18:20:30,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383677627] [2020-11-29 18:20:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:20:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:30,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 18:20:30,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 18:20:30,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:20:30,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 18:20:30,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462804512] [2020-11-29 18:20:30,212 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2020-11-29 18:20:30,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:30,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974867869] [2020-11-29 18:20:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:30,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:30,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:30,220 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:30,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:30,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:20:30,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:20:30,251 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-11-29 18:20:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:30,308 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-11-29 18:20:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:20:30,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2020-11-29 18:20:30,310 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:30,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2020-11-29 18:20:30,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-29 18:20:30,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-11-29 18:20:30,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2020-11-29 18:20:30,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:30,311 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-11-29 18:20:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2020-11-29 18:20:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2020-11-29 18:20:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-29 18:20:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-29 18:20:30,314 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-29 18:20:30,315 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-29 18:20:30,315 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 18:20:30,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2020-11-29 18:20:30,315 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:30,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:30,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:30,316 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:20:30,316 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:30,316 INFO L794 eck$LassoCheckResult]: Stem: 1077#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); 1076#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1072#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1073#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1074#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1075#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1093#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1092#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1091#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1090#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1089#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1088#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1087#L34-3 assume !(main_~i~1 < 5); 1071#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; 1061#L20-3 assume !!(sum_~i~0 < 5);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; 1062#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1068#L20-3 assume !!(sum_~i~0 < 5);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; 1095#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1063#L20-3 assume !!(sum_~i~0 < 5);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; 1064#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1084#L20-3 assume !(sum_~i~0 < 5); 1059#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1060#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; 1082#L20-8 assume !!(sum_~i~0 < 5);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; 1083#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1080#L20-8 assume !!(sum_~i~0 < 5);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; 1081#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1094#L20-8 assume !!(sum_~i~0 < 5);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; 1086#L20-7 [2020-11-29 18:20:30,316 INFO L796 eck$LassoCheckResult]: Loop: 1086#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1085#L20-8 assume !!(sum_~i~0 < 5);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; 1086#L20-7 [2020-11-29 18:20:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2020-11-29 18:20:30,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:30,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114894703] [2020-11-29 18:20:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-11-29 18:20:30,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114894703] [2020-11-29 18:20:30,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363164246] [2020-11-29 18:20:30,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:20:30,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 18:20:30,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:20:30,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 18:20:30,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-11-29 18:20:30,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:20:30,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 18:20:30,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020017153] [2020-11-29 18:20:30,496 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2020-11-29 18:20:30,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:30,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425014673] [2020-11-29 18:20:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:30,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:30,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:30,504 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:30,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:30,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:20:30,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:20:30,548 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-11-29 18:20:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:30,625 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-11-29 18:20:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:20:30,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2020-11-29 18:20:30,626 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:30,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2020-11-29 18:20:30,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-11-29 18:20:30,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-11-29 18:20:30,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2020-11-29 18:20:30,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:30,628 INFO L691 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-11-29 18:20:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2020-11-29 18:20:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2020-11-29 18:20:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-29 18:20:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-11-29 18:20:30,632 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-11-29 18:20:30,632 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-11-29 18:20:30,632 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 18:20:30,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2020-11-29 18:20:30,632 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:30,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:30,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:30,634 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:20:30,634 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:30,634 INFO L794 eck$LassoCheckResult]: Stem: 1255#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); 1250#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1251#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1252#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1253#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1254#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1272#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1271#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1270#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1269#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1268#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1267#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1266#L34-3 assume !(main_~i~1 < 5); 1249#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; 1240#L20-3 assume !!(sum_~i~0 < 5);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; 1241#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1242#L20-3 assume !!(sum_~i~0 < 5);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; 1243#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1275#L20-3 assume !!(sum_~i~0 < 5);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; 1274#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1273#L20-3 assume !!(sum_~i~0 < 5);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; 1263#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1262#L20-3 assume !(sum_~i~0 < 5); 1238#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1239#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; 1260#L20-8 assume !!(sum_~i~0 < 5);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; 1261#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1258#L20-8 assume !!(sum_~i~0 < 5);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; 1259#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1278#L20-8 assume !!(sum_~i~0 < 5);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; 1277#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1276#L20-8 assume !!(sum_~i~0 < 5);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; 1265#L20-7 [2020-11-29 18:20:30,634 INFO L796 eck$LassoCheckResult]: Loop: 1265#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1264#L20-8 assume !!(sum_~i~0 < 5);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; 1265#L20-7 [2020-11-29 18:20:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:30,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2020-11-29 18:20:30,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:30,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589502908] [2020-11-29 18:20:30,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-11-29 18:20:30,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589502908] [2020-11-29 18:20:30,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337692412] [2020-11-29 18:20:30,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:20:30,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-29 18:20:30,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:20:30,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 18:20:30,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-11-29 18:20:30,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:20:30,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 18:20:30,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870856290] [2020-11-29 18:20:30,833 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 18:20:30,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:30,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2020-11-29 18:20:30,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:30,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200849914] [2020-11-29 18:20:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:30,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:30,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:30,843 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:30,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:30,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 18:20:30,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:20:30,881 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-11-29 18:20:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:30,978 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-11-29 18:20:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:20:30,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2020-11-29 18:20:30,980 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:30,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2020-11-29 18:20:30,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-11-29 18:20:30,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-11-29 18:20:30,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2020-11-29 18:20:30,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:30,981 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-11-29 18:20:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2020-11-29 18:20:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2020-11-29 18:20:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-29 18:20:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-11-29 18:20:30,990 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-11-29 18:20:30,990 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-11-29 18:20:30,990 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-29 18:20:30,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2020-11-29 18:20:30,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-11-29 18:20:30,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:30,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:30,992 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:20:30,992 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:30,993 INFO L794 eck$LassoCheckResult]: Stem: 1454#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); 1449#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1450#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1451#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1452#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1453#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1475#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1473#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1471#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1469#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1467#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1465#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1464#L34-3 assume !(main_~i~1 < 5); 1448#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; 1439#L20-3 assume !!(sum_~i~0 < 5);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; 1440#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1441#L20-3 assume !!(sum_~i~0 < 5);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; 1442#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1481#L20-3 assume !!(sum_~i~0 < 5);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; 1480#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1479#L20-3 assume !!(sum_~i~0 < 5);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; 1478#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1477#L20-3 assume !!(sum_~i~0 < 5);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; 1461#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1460#L20-3 assume !(sum_~i~0 < 5); 1437#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1438#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; 1457#L20-8 assume !!(sum_~i~0 < 5);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; 1458#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1459#L20-8 assume !!(sum_~i~0 < 5);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; 1476#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1474#L20-8 assume !!(sum_~i~0 < 5);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; 1472#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1470#L20-8 assume !!(sum_~i~0 < 5);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; 1468#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1466#L20-8 assume !!(sum_~i~0 < 5);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; 1463#L20-7 [2020-11-29 18:20:30,993 INFO L796 eck$LassoCheckResult]: Loop: 1463#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1462#L20-8 assume !!(sum_~i~0 < 5);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; 1463#L20-7 [2020-11-29 18:20:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2020-11-29 18:20:30,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:30,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114479019] [2020-11-29 18:20:30,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,086 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,190 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2020-11-29 18:20:31,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:31,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281044387] [2020-11-29 18:20:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,199 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,201 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:31,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2020-11-29 18:20:31,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:31,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923828757] [2020-11-29 18:20:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:20:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-11-29 18:20:31,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923828757] [2020-11-29 18:20:31,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107926692] [2020-11-29 18:20:31,296 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:20:31,390 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-29 18:20:31,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:20:31,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 18:20:31,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:20:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-11-29 18:20:31,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 18:20:31,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2020-11-29 18:20:31,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195191037] [2020-11-29 18:20:31,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:20:31,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 18:20:31,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:20:31,486 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-11-29 18:20:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:20:31,612 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-29 18:20:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 18:20:31,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2020-11-29 18:20:31,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 18:20:31,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2020-11-29 18:20:31,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-11-29 18:20:31,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-11-29 18:20:31,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2020-11-29 18:20:31,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:20:31,615 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-29 18:20:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2020-11-29 18:20:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-29 18:20:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-29 18:20:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-29 18:20:31,617 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-29 18:20:31,617 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-29 18:20:31,617 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-29 18:20:31,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2020-11-29 18:20:31,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 18:20:31,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:20:31,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:20:31,619 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:20:31,619 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 18:20:31,620 INFO L794 eck$LassoCheckResult]: Stem: 1674#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); 1669#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1670#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1671#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1672#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1673#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1695#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1694#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1692#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1690#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 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1685#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1684#L34-3 assume !(main_~i~1 < 5); 1668#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; 1663#L20-3 assume !!(sum_~i~0 < 5);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; 1664#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1665#L20-3 assume !!(sum_~i~0 < 5);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; 1693#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1691#L20-3 assume !!(sum_~i~0 < 5);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; 1689#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1687#L20-3 assume !!(sum_~i~0 < 5);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; 1686#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1683#L20-3 assume !!(sum_~i~0 < 5);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; 1682#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1681#L20-3 assume !(sum_~i~0 < 5); 1661#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1662#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; 1679#L20-8 assume !!(sum_~i~0 < 5);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; 1680#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1677#L20-8 assume !!(sum_~i~0 < 5);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-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1702#L20-8 assume !!(sum_~i~0 < 5);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; 1701#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1700#L20-8 assume !!(sum_~i~0 < 5);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; 1699#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1698#L20-8 assume !!(sum_~i~0 < 5);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; 1697#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1696#L20-8 assume !(sum_~i~0 < 5); 1675#L20-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1676#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; 1666#L43-3 [2020-11-29 18:20:31,620 INFO L796 eck$LassoCheckResult]: Loop: 1666#L43-3 assume !!(main_~i~2 < 4);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; 1667#L43-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 1666#L43-3 [2020-11-29 18:20:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2020-11-29 18:20:31,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:31,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192045723] [2020-11-29 18:20:31,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,787 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:31,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2020-11-29 18:20:31,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:31,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571424113] [2020-11-29 18:20:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,794 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,795 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:20:31,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:20:31,795 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2020-11-29 18:20:31,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:20:31,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519663319] [2020-11-29 18:20:31,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:20:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:20:31,923 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:20:31,934 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:21:15,050 WARN L193 SmtUtils]: Spent 43.05 s on a formula simplification. DAG size of input: 383 DAG size of output: 278 [2020-11-29 18:21:15,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:21:15,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:21:15,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:21:22,628 WARN L193 SmtUtils]: Spent 7.35 s on a formula simplification. DAG size of input: 283 DAG size of output: 201 [2020-11-29 18:21:22,633 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 18:21:22,633 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 18:21:22,633 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 18:21:22,633 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 18:21:22,633 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 18:21:22,633 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:21:22,633 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 18:21:22,633 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 18:21:22,633 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration14_Lasso [2020-11-29 18:21:22,633 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 18:21:22,634 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 18:21:22,652 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 18:21:22,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:21:22,677 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 18:21:22,680 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 18:21:22,683 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 18:21:27,853 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2020-11-29 18:21:28,867 WARN L193 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 116 [2020-11-29 18:21:29,014 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 18:21:29,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:21:29,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:21:29,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:21:29,040 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 18:21:29,045 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 18:21:29,048 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 18:21:29,051 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 18:21:29,053 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 18:21:29,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 18:21:29,059 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 18:21:29,061 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 18:21:29,064 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 18:21:30,355 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2020-11-29 18:21:30,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2020-11-29 18:21:32,345 WARN L193 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 130 DAG size of output: 123 [2020-11-29 18:21:32,451 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 18:21:32,452 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:32,455 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 18:21:32,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:21:32,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:21:32,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:21:32,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:32,484 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 18:21:32,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:21:32,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:21:32,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:21:32,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_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:32,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 18:21:32,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:21:32,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:21:32,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:21:32,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:32,560 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 18:21:32,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:21:32,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:21:32,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:32,593 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 18:21:32,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:21:32,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:21:32,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:32,633 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 18:21:32,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:21:32,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:21:32,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:21:32,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:21:32,665 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 18:21:32,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:21:32,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:21:32,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:21:32,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:32,697 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 18:21:32,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:21:32,706 INFO L402 nArgumentSynthesizer]: A total of 2 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 18:21:32,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:32,772 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 18:21:32,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:21:32,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:21:32,775 INFO L402 nArgumentSynthesizer]: A total of 0 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 18:21:32,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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) [2020-11-29 18:21:32,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 18:21:32,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:21:32,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:21:32,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 18:21:32,880 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 18:21:32,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:21:32,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:21:32,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/bin/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:21:32,933 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 18:21:32,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:21:32,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:21:32,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:32,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 18:21:32,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:32,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:32,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:32,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:32,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 18:21:32,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:21:32,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:33,007 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 18:21:33,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:33,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 18:21:33,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 18:21:33,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:33,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:33,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 18:21:33,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 18:21:33,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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 18:21:33,038 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 18:21:33,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 18:21:33,041 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-11-29 18:21:33,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 18:21:33,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 18:21:33,114 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-11-29 18:21:33,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 18:21:33,158 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 18:21:33,309 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-11-29 18:21:33,309 INFO L444 ModelExtractionUtils]: 33 out of 67 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab637cb-e918-4bbe-8ec8-ba4707c3efd0/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) [2020-11-29 18:21:33,320 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 18:21:33,328 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 18:21:33,328 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 18:21:33,328 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2020-11-29 18:21:33,729 INFO L297 tatePredicateManager]: 48 out of 48 supporting invariants were superfluous and have been removed [2020-11-29 18:21:33,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:21:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:21:33,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 18:21:33,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:21:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:21:33,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 18:21:33,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:21:33,882 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 18:21:33,882 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 18:21:33,883 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-11-29 18:21:33,910 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 44 states and 46 transitions. Complement of second has 4 states. [2020-11-29 18:21:33,911 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 18:21:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 18:21:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-11-29 18:21:33,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2020-11-29 18:21:33,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:21:33,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2020-11-29 18:21:33,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:21:33,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2020-11-29 18:21:33,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 18:21:33,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2020-11-29 18:21:33,913 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 18:21:33,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2020-11-29 18:21:33,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 18:21:33,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 18:21:33,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 18:21:33,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:21:33,914 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 18:21:33,914 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 18:21:33,914 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 18:21:33,914 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-11-29 18:21:33,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 18:21:33,914 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 18:21:33,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 18:21:33,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 06:21:33 BoogieIcfgContainer [2020-11-29 18:21:33,918 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 18:21:33,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:21:33,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:21:33,919 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:21:33,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:20:22" (3/4) ... [2020-11-29 18:21:33,921 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 18:21:33,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:21:33,922 INFO L168 Benchmark]: Toolchain (without parser) took 72322.31 ms. Allocated memory was 102.8 MB in the beginning and 209.7 MB in the end (delta: 107.0 MB). Free memory was 79.4 MB in the beginning and 116.9 MB in the end (delta: -37.5 MB). Peak memory consumption was 70.3 MB. Max. memory is 16.1 GB. [2020-11-29 18:21:33,923 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 102.8 MB. Free memory was 62.4 MB in the beginning and 62.4 MB in the end (delta: 61.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:21:33,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.55 ms. Allocated memory was 102.8 MB in the beginning and 142.6 MB in the end (delta: 39.8 MB). Free memory was 79.4 MB in the beginning and 119.0 MB in the end (delta: -39.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:21:33,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.97 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 116.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:21:33,927 INFO L168 Benchmark]: Boogie Preprocessor took 31.90 ms. Allocated memory is still 142.6 MB. Free memory was 116.9 MB in the beginning and 115.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:21:33,927 INFO L168 Benchmark]: RCFGBuilder took 491.03 ms. Allocated memory is still 142.6 MB. Free memory was 115.6 MB in the beginning and 98.4 MB in the end (delta: 17.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-29 18:21:33,928 INFO L168 Benchmark]: BuchiAutomizer took 71397.65 ms. Allocated memory was 142.6 MB in the beginning and 209.7 MB in the end (delta: 67.1 MB). Free memory was 98.4 MB in the beginning and 117.9 MB in the end (delta: -19.5 MB). Peak memory consumption was 48.9 MB. Max. memory is 16.1 GB. [2020-11-29 18:21:33,928 INFO L168 Benchmark]: Witness Printer took 2.69 ms. Allocated memory is still 209.7 MB. Free memory was 117.9 MB in the beginning and 116.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:21:33,930 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93 ms. Allocated memory is still 102.8 MB. Free memory was 62.4 MB in the beginning and 62.4 MB in the end (delta: 61.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 346.55 ms. Allocated memory was 102.8 MB in the beginning and 142.6 MB in the end (delta: 39.8 MB). Free memory was 79.4 MB in the beginning and 119.0 MB in the end (delta: -39.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.97 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 116.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.90 ms. Allocated memory is still 142.6 MB. Free memory was 116.9 MB in the beginning and 115.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 491.03 ms. Allocated memory is still 142.6 MB. Free memory was 115.6 MB in the beginning and 98.4 MB in the end (delta: 17.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 71397.65 ms. Allocated memory was 142.6 MB in the beginning and 209.7 MB in the end (delta: 67.1 MB). Free memory was 98.4 MB in the beginning and 117.9 MB in the end (delta: -19.5 MB). Peak memory consumption was 48.9 MB. Max. memory is 16.1 GB. * Witness Printer took 2.69 ms. Allocated memory is still 209.7 MB. Free memory was 117.9 MB in the beginning and 116.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. 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 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 71.3s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 69.9s. Construction of modules took 0.5s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 233 SDtfs, 164 SDslu, 421 SDs, 0 SdLazy, 316 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital638 mio100 ax100 hnf99 lsp238 ukn40 mio100 lsp91 div97 bol100 ite100 ukn100 eq161 hnf88 smp85 dnf231 smp74 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 292ms VariablesStem: 41 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...