./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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 64bit --witnessprinter.graph.data.programhash b6ea490b9c20ea87d0996e916d918afb3a914616 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:18:50,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:18:50,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:18:50,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:18:50,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:18:50,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:18:50,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:18:50,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:18:50,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:18:50,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:18:50,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:18:50,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:18:50,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:18:50,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:18:50,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:18:50,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:18:50,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:18:50,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:18:50,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:18:50,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:18:50,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:18:50,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:18:50,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:18:50,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:18:50,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:18:50,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:18:50,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:18:50,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:18:50,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:18:50,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:18:50,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:18:50,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:18:50,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:18:50,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:18:50,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:18:50,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:18:50,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:18:50,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:18:50,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:18:50,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:18:50,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:18:50,148 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-28 03:18:50,171 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:18:50,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:18:50,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:18:50,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:18:50,174 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:18:50,174 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:18:50,174 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:18:50,174 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:18:50,174 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:18:50,175 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:18:50,175 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:18:50,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:18:50,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:18:50,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:18:50,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:18:50,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:18:50,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:18:50,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:18:50,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:18:50,177 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:18:50,177 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:18:50,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:18:50,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:18:50,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:18:50,178 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:18:50,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:18:50,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:18:50,179 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:18:50,179 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:18:50,180 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:18:50,180 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_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6ea490b9c20ea87d0996e916d918afb3a914616 [2020-11-28 03:18:50,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:18:50,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:18:50,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:18:50,473 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:18:50,475 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:18:50,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2020-11-28 03:18:50,545 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/data/733b948b3/2fb75ddeea5646619676898034a561f1/FLAG12f9e6b1a [2020-11-28 03:18:51,032 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:18:51,033 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2020-11-28 03:18:51,064 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/data/733b948b3/2fb75ddeea5646619676898034a561f1/FLAG12f9e6b1a [2020-11-28 03:18:51,381 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/data/733b948b3/2fb75ddeea5646619676898034a561f1 [2020-11-28 03:18:51,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:18:51,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:18:51,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:18:51,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:18:51,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:18:51,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2d9672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51, skipping insertion in model container [2020-11-28 03:18:51,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:18:51,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:18:51,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:18:51,724 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:18:51,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:18:51,818 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:18:51,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51 WrapperNode [2020-11-28 03:18:51,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:18:51,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:18:51,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:18:51,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:18:51,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:18:51,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:18:51,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:18:51,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:18:51,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... [2020-11-28 03:18:51,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:18:51,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:18:51,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:18:51,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:18:51,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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-28 03:18:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-28 03:18:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:18:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:18:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:18:51,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:18:51,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:18:52,215 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:18:52,215 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-28 03:18:52,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:52 BoogieIcfgContainer [2020-11-28 03:18:52,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:18:52,218 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:18:52,218 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:18:52,221 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:18:52,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:18:52,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:18:51" (1/3) ... [2020-11-28 03:18:52,224 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ef14f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:18:52, skipping insertion in model container [2020-11-28 03:18:52,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:18:52,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:51" (2/3) ... [2020-11-28 03:18:52,225 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ef14f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:18:52, skipping insertion in model container [2020-11-28 03:18:52,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:18:52,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:52" (3/3) ... [2020-11-28 03:18:52,226 INFO L373 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca.i [2020-11-28 03:18:52,283 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:18:52,283 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:18:52,283 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:18:52,283 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:18:52,283 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:18:52,283 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:18:52,284 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:18:52,284 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:18:52,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-28 03:18:52,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-28 03:18:52,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:52,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:52,337 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:52,337 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-28 03:18:52,337 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:18:52,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-28 03:18:52,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-28 03:18:52,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:52,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:52,339 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:52,339 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-28 03:18:52,346 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L549-3true [2020-11-28 03:18:52,347 INFO L796 eck$LassoCheckResult]: Loop: 8#L549-3true call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 4#L549-1true assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 5#L551-3true assume !true; 7#L551-4true call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 8#L549-3true [2020-11-28 03:18:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-28 03:18:52,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:52,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370511675] [2020-11-28 03:18:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:52,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:52,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:52,507 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:52,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2020-11-28 03:18:52,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:52,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517527914] [2020-11-28 03:18:52,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:52,552 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-28 03:18:52,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517527914] [2020-11-28 03:18:52,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:52,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:18:52,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618765867] [2020-11-28 03:18:52,559 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:52,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:52,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-28 03:18:52,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-28 03:18:52,578 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2020-11-28 03:18:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:52,586 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-11-28 03:18:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:18:52,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-11-28 03:18:52,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-28 03:18:52,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2020-11-28 03:18:52,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-28 03:18:52,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-28 03:18:52,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-11-28 03:18:52,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:52,595 INFO L691 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-11-28 03:18:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-11-28 03:18:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-11-28 03:18:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-28 03:18:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-11-28 03:18:52,616 INFO L714 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-11-28 03:18:52,616 INFO L594 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-11-28 03:18:52,616 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:18:52,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-11-28 03:18:52,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-28 03:18:52,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:52,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:52,618 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:52,618 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-28 03:18:52,618 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 30#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 31#L549-3 [2020-11-28 03:18:52,618 INFO L796 eck$LassoCheckResult]: Loop: 31#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 32#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 33#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 34#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 36#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 31#L549-3 [2020-11-28 03:18:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:52,619 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-28 03:18:52,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:52,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193174021] [2020-11-28 03:18:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:52,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:52,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:52,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2020-11-28 03:18:52,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:52,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268063637] [2020-11-28 03:18:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:52,746 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-28 03:18:52,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268063637] [2020-11-28 03:18:52,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:52,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:18:52,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830619412] [2020-11-28 03:18:52,747 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:52,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:18:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:18:52,749 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-11-28 03:18:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:52,798 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-11-28 03:18:52,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:18:52,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-11-28 03:18:52,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-28 03:18:52,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2020-11-28 03:18:52,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-11-28 03:18:52,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-11-28 03:18:52,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-11-28 03:18:52,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:52,802 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-11-28 03:18:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-11-28 03:18:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-11-28 03:18:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-28 03:18:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-11-28 03:18:52,804 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-11-28 03:18:52,804 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-11-28 03:18:52,804 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:18:52,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-11-28 03:18:52,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-28 03:18:52,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:52,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:52,805 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:52,805 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2020-11-28 03:18:52,805 INFO L794 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 57#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 58#L549-3 [2020-11-28 03:18:52,806 INFO L796 eck$LassoCheckResult]: Loop: 58#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 59#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 55#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 56#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 62#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 63#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 60#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 58#L549-3 [2020-11-28 03:18:52,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:52,806 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-28 03:18:52,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:52,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569060909] [2020-11-28 03:18:52,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:52,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:52,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:52,831 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2020-11-28 03:18:52,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:52,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406642310] [2020-11-28 03:18:52,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:52,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406642310] [2020-11-28 03:18:52,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162615772] [2020-11-28 03:18:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:18:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:52,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:18:53,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:53,057 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 03:18:53,058 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,062 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,062 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-28 03:18:53,083 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:53,084 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,088 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:53,110 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 03:18:53,111 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,114 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,114 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-28 03:18:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:53,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:18:53,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-28 03:18:53,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371739392] [2020-11-28 03:18:53,130 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:53,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:18:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:18:53,131 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-11-28 03:18:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:53,196 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-11-28 03:18:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:18:53,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-11-28 03:18:53,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-11-28 03:18:53,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-11-28 03:18:53,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-28 03:18:53,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 03:18:53,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-11-28 03:18:53,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:53,199 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-11-28 03:18:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-11-28 03:18:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-11-28 03:18:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-11-28 03:18:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-11-28 03:18:53,201 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-11-28 03:18:53,201 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-11-28 03:18:53,201 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:18:53,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-11-28 03:18:53,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-11-28 03:18:53,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:53,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:53,202 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:53,202 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2020-11-28 03:18:53,203 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 108#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 109#L549-3 [2020-11-28 03:18:53,203 INFO L796 eck$LassoCheckResult]: Loop: 109#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 110#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 106#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 107#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 113#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 116#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 115#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 114#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 111#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 109#L549-3 [2020-11-28 03:18:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-28 03:18:53,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:53,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165419895] [2020-11-28 03:18:53,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:53,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:53,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:53,239 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1970998361, now seen corresponding path program 2 times [2020-11-28 03:18:53,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:53,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815075126] [2020-11-28 03:18:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:53,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815075126] [2020-11-28 03:18:53,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421392149] [2020-11-28 03:18:53,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:18:53,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 03:18:53,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:18:53,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-28 03:18:53,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:53,396 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 03:18:53,397 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,406 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,407 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,407 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-28 03:18:53,416 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:53,417 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,423 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,423 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:53,438 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:53,439 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,442 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,442 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,443 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:53,473 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 03:18:53,474 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,477 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,477 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-28 03:18:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:53,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:18:53,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-11-28 03:18:53,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37822755] [2020-11-28 03:18:53,489 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:53,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:53,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:18:53,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:18:53,490 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-11-28 03:18:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:53,581 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-11-28 03:18:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:18:53,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2020-11-28 03:18:53,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-11-28 03:18:53,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2020-11-28 03:18:53,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-28 03:18:53,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-28 03:18:53,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2020-11-28 03:18:53,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:53,583 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-11-28 03:18:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2020-11-28 03:18:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-11-28 03:18:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-28 03:18:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-11-28 03:18:53,585 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-11-28 03:18:53,585 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-11-28 03:18:53,586 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:18:53,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-11-28 03:18:53,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-11-28 03:18:53,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:53,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:53,587 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:53,587 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2020-11-28 03:18:53,587 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 173#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 174#L549-3 [2020-11-28 03:18:53,587 INFO L796 eck$LassoCheckResult]: Loop: 174#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 175#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 176#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 179#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 171#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 172#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 183#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 182#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 181#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 180#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 177#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 174#L549-3 [2020-11-28 03:18:53,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:53,588 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-11-28 03:18:53,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:53,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990268475] [2020-11-28 03:18:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:53,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:53,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:53,614 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:53,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -48795806, now seen corresponding path program 3 times [2020-11-28 03:18:53,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:53,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376929557] [2020-11-28 03:18:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:53,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376929557] [2020-11-28 03:18:53,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890546629] [2020-11-28 03:18:53,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:18:53,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-28 03:18:53,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:18:53,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 03:18:53,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:53,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 03:18:53,821 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,824 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,824 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-28 03:18:53,835 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:53,835 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,838 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,838 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:53,856 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:53,857 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,862 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,862 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:53,883 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:53,884 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,891 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,891 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:53,918 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 03:18:53,925 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:53,928 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:53,928 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-28 03:18:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:53,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:18:53,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-11-28 03:18:53,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808210510] [2020-11-28 03:18:53,934 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:53,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-28 03:18:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:18:53,935 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-11-28 03:18:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:54,034 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-11-28 03:18:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 03:18:54,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2020-11-28 03:18:54,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-11-28 03:18:54,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2020-11-28 03:18:54,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-28 03:18:54,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-28 03:18:54,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2020-11-28 03:18:54,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:54,037 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-11-28 03:18:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2020-11-28 03:18:54,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-28 03:18:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-28 03:18:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-11-28 03:18:54,038 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-11-28 03:18:54,039 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-11-28 03:18:54,039 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:18:54,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-11-28 03:18:54,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-11-28 03:18:54,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:54,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:54,040 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:54,040 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2020-11-28 03:18:54,040 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 250#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 251#L549-3 [2020-11-28 03:18:54,040 INFO L796 eck$LassoCheckResult]: Loop: 251#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 252#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 253#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 258#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 254#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 255#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 264#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 263#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 262#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 261#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 260#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 259#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 257#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 251#L549-3 [2020-11-28 03:18:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:54,041 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-11-28 03:18:54,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:54,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805409996] [2020-11-28 03:18:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:54,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:54,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:54,053 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:54,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:54,054 INFO L82 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 4 times [2020-11-28 03:18:54,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:54,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345847191] [2020-11-28 03:18:54,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:54,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345847191] [2020-11-28 03:18:54,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119706417] [2020-11-28 03:18:54,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:18:54,224 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 03:18:54,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:18:54,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 03:18:54,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:54,234 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 03:18:54,234 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,238 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,238 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-28 03:18:54,248 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:54,248 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,255 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,256 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:54,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:54,283 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,289 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,290 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:54,311 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:54,312 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,316 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,316 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:54,337 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:54,337 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,340 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,340 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,341 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:54,364 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 03:18:54,365 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,368 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,368 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,368 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-28 03:18:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:54,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:18:54,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-11-28 03:18:54,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202664848] [2020-11-28 03:18:54,374 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:54,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-28 03:18:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-11-28 03:18:54,375 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 12 states. [2020-11-28 03:18:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:54,545 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-11-28 03:18:54,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-28 03:18:54,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2020-11-28 03:18:54,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-11-28 03:18:54,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2020-11-28 03:18:54,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-28 03:18:54,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-28 03:18:54,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2020-11-28 03:18:54,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:54,547 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-11-28 03:18:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2020-11-28 03:18:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-11-28 03:18:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-28 03:18:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-11-28 03:18:54,549 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-11-28 03:18:54,550 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-11-28 03:18:54,550 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:18:54,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2020-11-28 03:18:54,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-11-28 03:18:54,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:54,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:54,551 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:54,551 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2020-11-28 03:18:54,551 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 345#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 346#L549-3 [2020-11-28 03:18:54,551 INFO L796 eck$LassoCheckResult]: Loop: 346#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 347#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 348#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 351#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 343#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 344#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 359#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 358#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 357#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 356#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 355#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 354#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 353#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 352#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 349#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 346#L549-3 [2020-11-28 03:18:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-11-28 03:18:54,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:54,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431720319] [2020-11-28 03:18:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:54,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:54,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:54,571 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:54,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1105064296, now seen corresponding path program 5 times [2020-11-28 03:18:54,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:54,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440718604] [2020-11-28 03:18:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:54,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440718604] [2020-11-28 03:18:54,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122630184] [2020-11-28 03:18:54,715 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:18:54,782 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-28 03:18:54,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:18:54,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-28 03:18:54,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:54,795 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 03:18:54,795 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,798 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,798 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-28 03:18:54,806 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:54,807 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,810 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,810 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,810 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:54,823 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:54,824 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,830 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,830 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:54,845 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:54,846 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,856 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,856 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:54,875 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:54,876 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,880 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,880 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,880 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:54,895 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:54,896 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,898 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,898 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,898 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:54,920 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 03:18:54,921 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:54,922 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:54,923 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-28 03:18:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:54,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:18:54,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-11-28 03:18:54,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741481527] [2020-11-28 03:18:54,930 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:54,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:54,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-28 03:18:54,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-28 03:18:54,931 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand 14 states. [2020-11-28 03:18:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:55,112 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-11-28 03:18:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-28 03:18:55,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2020-11-28 03:18:55,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-11-28 03:18:55,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2020-11-28 03:18:55,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-11-28 03:18:55,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-11-28 03:18:55,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2020-11-28 03:18:55,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:55,115 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-11-28 03:18:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2020-11-28 03:18:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-11-28 03:18:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-28 03:18:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-11-28 03:18:55,117 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-11-28 03:18:55,117 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-11-28 03:18:55,117 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:18:55,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2020-11-28 03:18:55,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-11-28 03:18:55,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:55,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:55,118 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:55,119 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2020-11-28 03:18:55,119 INFO L794 eck$LassoCheckResult]: Stem: 457#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 450#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 451#L549-3 [2020-11-28 03:18:55,119 INFO L796 eck$LassoCheckResult]: Loop: 451#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 452#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 453#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 458#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 454#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 455#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 468#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 467#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 466#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 465#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 464#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 463#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 462#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 461#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 460#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 459#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 456#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 451#L549-3 [2020-11-28 03:18:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-11-28 03:18:55,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:55,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419227032] [2020-11-28 03:18:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:55,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:55,132 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:55,134 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1109814765, now seen corresponding path program 6 times [2020-11-28 03:18:55,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:55,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225640988] [2020-11-28 03:18:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:55,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225640988] [2020-11-28 03:18:55,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413209262] [2020-11-28 03:18:55,269 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:18:55,343 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-11-28 03:18:55,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:18:55,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 03:18:55,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:55,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 03:18:55,360 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,362 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-28 03:18:55,379 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:55,379 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,382 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,383 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:55,396 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:55,396 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,399 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,399 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,399 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:55,415 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:55,416 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,418 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,418 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:55,432 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:55,433 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,437 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,437 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:55,452 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:55,453 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,465 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,465 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:55,483 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:55,483 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,486 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,486 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:55,503 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 03:18:55,504 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,506 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,506 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-28 03:18:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:55,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:18:55,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-11-28 03:18:55,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105598768] [2020-11-28 03:18:55,515 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:55,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:55,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-28 03:18:55,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-11-28 03:18:55,516 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand 16 states. [2020-11-28 03:18:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:55,739 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-11-28 03:18:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-28 03:18:55,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2020-11-28 03:18:55,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-11-28 03:18:55,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2020-11-28 03:18:55,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-11-28 03:18:55,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-11-28 03:18:55,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2020-11-28 03:18:55,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:55,741 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-11-28 03:18:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2020-11-28 03:18:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-11-28 03:18:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-28 03:18:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-11-28 03:18:55,743 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-11-28 03:18:55,743 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-11-28 03:18:55,744 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-28 03:18:55,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2020-11-28 03:18:55,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-11-28 03:18:55,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:55,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:55,745 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:55,745 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2020-11-28 03:18:55,745 INFO L794 eck$LassoCheckResult]: Stem: 577#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 573#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 574#L549-3 [2020-11-28 03:18:55,745 INFO L796 eck$LassoCheckResult]: Loop: 574#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 575#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 576#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 579#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 571#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 572#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 591#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 590#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 589#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 588#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 587#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 586#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 585#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 584#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 583#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 582#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 581#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 580#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 578#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 574#L549-3 [2020-11-28 03:18:55,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:55,746 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-11-28 03:18:55,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:55,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902999450] [2020-11-28 03:18:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:55,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:55,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:55,756 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1380048178, now seen corresponding path program 7 times [2020-11-28 03:18:55,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:55,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022760312] [2020-11-28 03:18:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:55,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022760312] [2020-11-28 03:18:55,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539514207] [2020-11-28 03:18:55,895 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:18:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:55,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-28 03:18:55,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:55,969 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 03:18:55,969 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,972 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,972 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-28 03:18:55,978 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:55,979 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,982 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,982 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:55,995 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:55,996 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,999 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:55,999 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:55,999 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:56,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,015 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,021 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,021 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:56,039 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,040 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,042 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,043 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,043 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:56,061 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,062 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,065 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,065 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:56,086 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,087 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,090 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,090 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,090 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:56,111 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,112 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,115 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,115 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:56,137 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 03:18:56,138 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,140 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,140 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-28 03:18:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:56,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:18:56,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2020-11-28 03:18:56,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963479099] [2020-11-28 03:18:56,147 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:56,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:56,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-28 03:18:56,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-11-28 03:18:56,148 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 18 states. [2020-11-28 03:18:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:56,459 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-11-28 03:18:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-28 03:18:56,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2020-11-28 03:18:56,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-11-28 03:18:56,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2020-11-28 03:18:56,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-28 03:18:56,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-28 03:18:56,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2020-11-28 03:18:56,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:56,462 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-11-28 03:18:56,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2020-11-28 03:18:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-11-28 03:18:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-28 03:18:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-11-28 03:18:56,464 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-11-28 03:18:56,464 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-11-28 03:18:56,464 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-28 03:18:56,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2020-11-28 03:18:56,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-11-28 03:18:56,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:56,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:56,466 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:56,466 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2020-11-28 03:18:56,466 INFO L794 eck$LassoCheckResult]: Stem: 713#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 708#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 709#L549-3 [2020-11-28 03:18:56,466 INFO L796 eck$LassoCheckResult]: Loop: 709#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 710#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 711#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 714#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 706#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 707#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 728#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 727#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 726#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 725#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 724#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 723#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 722#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 721#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 720#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 719#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 718#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 717#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 716#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 715#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 712#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 709#L549-3 [2020-11-28 03:18:56,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:56,466 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-11-28 03:18:56,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:56,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256044734] [2020-11-28 03:18:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:56,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:56,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:56,475 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:56,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:56,476 INFO L82 PathProgramCache]: Analyzing trace with hash 918646985, now seen corresponding path program 8 times [2020-11-28 03:18:56,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:56,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510625503] [2020-11-28 03:18:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:56,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510625503] [2020-11-28 03:18:56,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327753609] [2020-11-28 03:18:56,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:18:56,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 03:18:56,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:18:56,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-28 03:18:56,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:18:56,679 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 03:18:56,679 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,682 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,682 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-28 03:18:56,688 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,688 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,691 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,691 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:56,704 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,704 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,707 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,707 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:56,725 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,726 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,728 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,729 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,729 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:56,745 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,745 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,748 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,749 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:56,793 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,793 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,796 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,796 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:18:56,823 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,824 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,827 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,827 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,827 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:56,846 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,847 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,849 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,850 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,850 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:56,873 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:18:56,874 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,878 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,878 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:18:56,900 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 03:18:56,901 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:56,903 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:18:56,904 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-28 03:18:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:56,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:18:56,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-28 03:18:56,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608667413] [2020-11-28 03:18:56,910 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:56,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-28 03:18:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-11-28 03:18:56,912 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand 20 states. [2020-11-28 03:18:57,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:57,228 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-11-28 03:18:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-28 03:18:57,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2020-11-28 03:18:57,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-11-28 03:18:57,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2020-11-28 03:18:57,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-11-28 03:18:57,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-11-28 03:18:57,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2020-11-28 03:18:57,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:57,231 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-11-28 03:18:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2020-11-28 03:18:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-11-28 03:18:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-28 03:18:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-11-28 03:18:57,237 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-11-28 03:18:57,237 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-11-28 03:18:57,237 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-28 03:18:57,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2020-11-28 03:18:57,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-11-28 03:18:57,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:57,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:57,239 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:57,241 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2020-11-28 03:18:57,241 INFO L794 eck$LassoCheckResult]: Stem: 862#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 857#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 858#L549-3 [2020-11-28 03:18:57,241 INFO L796 eck$LassoCheckResult]: Loop: 858#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 859#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 860#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 863#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 855#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 856#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 879#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 878#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 877#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 876#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 875#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 874#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 873#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 872#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 871#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 870#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 869#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 868#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 867#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 866#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 865#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 864#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 861#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 858#L549-3 [2020-11-28 03:18:57,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-11-28 03:18:57,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:57,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369465689] [2020-11-28 03:18:57,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:57,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:57,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:57,256 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 9 times [2020-11-28 03:18:57,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:57,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485407768] [2020-11-28 03:18:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:57,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:57,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:57,343 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:57,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:57,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2020-11-28 03:18:57,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:57,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657231445] [2020-11-28 03:18:57,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:57,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:57,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:57,384 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:19:01,633 WARN L193 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 138 DAG size of output: 127 [2020-11-28 03:19:01,802 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:19:01,802 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:19:01,802 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:19:01,803 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:19:01,803 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:19:01,803 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:19:01,803 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:19:01,803 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:19:01,803 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration11_Lasso [2020-11-28 03:19:01,803 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:19:01,803 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:19:01,817 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-28 03:19:01,822 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-28 03:19:01,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:19:01,990 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2020-11-28 03:19:02,077 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-28 03:19:02,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:19:02,083 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-28 03:19:02,086 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-28 03:19:02,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:19:02,092 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-28 03:19:02,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:19:02,098 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-28 03:19:02,465 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:19:02,469 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:19:02,472 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-28 03:19:02,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:19:02,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:19:02,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:19:02,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:19:02,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:19:02,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:19:02,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:19:02,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:19:02,503 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-28 03:19:02,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:19:02,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:19:02,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:19:02,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:19:02,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:19:02,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:19:02,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:19:02,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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-28 03:19:02,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-28 03:19:02,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:19:02,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:19:02,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:19:02,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:19:02,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:19:02,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:19:02,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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-28 03:19:02,602 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-28 03:19:02,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:19:02,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:19:02,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:19:02,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:19:02,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:19:02,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:19:02,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:19:02,642 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-28 03:19:02,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:19:02,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:19:02,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:19:02,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:19:02,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:19:02,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:19:02,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:19:02,683 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-28 03:19:02,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:19:02,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:19:02,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:19:02,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:19:02,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:19:02,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:19:02,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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-28 03:19:02,713 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-28 03:19:02,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:19:02,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:19:02,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:19:02,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:19:02,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:19:02,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:19:02,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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-28 03:19:02,764 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-28 03:19:02,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:19:02,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:19:02,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:19:02,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:19:02,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:19:02,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:19:02,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:19:02,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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) [2020-11-28 03:19:02,792 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:19:02,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:19:02,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:19:02,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:19:02,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:19:02,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:19:02,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:19:02,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:19:02,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:19:02,825 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-28 03:19:02,825 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/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) [2020-11-28 03:19:02,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 03:19:02,833 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-28 03:19:02,833 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:19:02,833 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1 + 21 Supporting invariants [] Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:19:02,904 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-11-28 03:19:02,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-28 03:19:03,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:19:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:19:03,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 03:19:03,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:19:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:19:03,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-28 03:19:03,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:19:03,090 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-11-28 03:19:03,091 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,123 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,123 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-11-28 03:19:03,162 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2020-11-28 03:19:03,163 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,179 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,179 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,179 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2020-11-28 03:19:03,214 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2020-11-28 03:19:03,215 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,234 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,235 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,235 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2020-11-28 03:19:03,284 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2020-11-28 03:19:03,285 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,302 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,302 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-11-28 03:19:03,347 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2020-11-28 03:19:03,348 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,359 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,360 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-11-28 03:19:03,403 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2020-11-28 03:19:03,404 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,415 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,415 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-11-28 03:19:03,447 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2020-11-28 03:19:03,448 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,461 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,461 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-11-28 03:19:03,507 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2020-11-28 03:19:03,508 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,518 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,518 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2020-11-28 03:19:03,569 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2020-11-28 03:19:03,570 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,580 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2020-11-28 03:19:03,654 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2020-11-28 03:19:03,655 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:03,668 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:03,668 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-28 03:19:03,669 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:30 [2020-11-28 03:19:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:19:03,750 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2020-11-28 03:19:03,751 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 13 states. [2020-11-28 03:19:04,210 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand 13 states. Result 57 states and 62 transitions. Complement of second has 26 states. [2020-11-28 03:19:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-11-28 03:19:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-28 03:19:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2020-11-28 03:19:04,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 23 letters. [2020-11-28 03:19:04,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:19:04,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 25 letters. Loop has 23 letters. [2020-11-28 03:19:04,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:19:04,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 46 letters. [2020-11-28 03:19:04,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:19:04,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2020-11-28 03:19:04,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-11-28 03:19:04,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 61 transitions. [2020-11-28 03:19:04,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-28 03:19:04,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-11-28 03:19:04,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 61 transitions. [2020-11-28 03:19:04,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:19:04,219 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-11-28 03:19:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 61 transitions. [2020-11-28 03:19:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-11-28 03:19:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-28 03:19:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2020-11-28 03:19:04,233 INFO L714 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2020-11-28 03:19:04,233 INFO L594 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2020-11-28 03:19:04,233 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-28 03:19:04,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 60 transitions. [2020-11-28 03:19:04,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-11-28 03:19:04,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:19:04,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:19:04,236 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-28 03:19:04,237 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1] [2020-11-28 03:19:04,237 INFO L794 eck$LassoCheckResult]: Stem: 1133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1124#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1125#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1126#L549-1 [2020-11-28 03:19:04,238 INFO L796 eck$LassoCheckResult]: Loop: 1126#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 1127#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1130#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1139#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1159#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1158#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1157#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1156#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1155#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1154#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1153#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1152#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1151#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1150#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1149#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1148#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1147#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1146#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1145#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1144#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1143#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1142#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1141#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 1134#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 1135#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1126#L549-1 [2020-11-28 03:19:04,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:19:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-11-28 03:19:04,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:19:04,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937626405] [2020-11-28 03:19:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:19:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:19:04,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:19:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:19:04,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:19:04,260 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:19:04,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:19:04,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1726515181, now seen corresponding path program 10 times [2020-11-28 03:19:04,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:19:04,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195806028] [2020-11-28 03:19:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:19:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:19:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 84 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:19:04,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195806028] [2020-11-28 03:19:04,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607478164] [2020-11-28 03:19:04,471 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e08e3c-057c-46c7-b9f8-09e7faf059fb/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:19:04,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 03:19:04,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:19:04,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-28 03:19:04,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:19:04,550 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 03:19:04,550 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,552 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,553 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,553 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-28 03:19:04,560 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:19:04,561 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,563 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,563 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,563 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:19:04,586 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:19:04,586 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,589 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,589 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:19:04,610 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:19:04,611 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,614 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,614 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:19:04,639 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:19:04,640 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,642 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,643 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,643 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:19:04,669 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:19:04,670 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,673 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,673 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:19:04,706 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:19:04,706 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,709 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,709 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:19:04,753 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:19:04,754 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,757 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,757 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:19:04,790 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:19:04,791 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,793 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,794 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,794 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2020-11-28 03:19:04,831 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-28 03:19:04,832 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,835 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,835 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-11-28 03:19:04,879 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 03:19:04,880 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:19:04,882 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:19:04,883 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-28 03:19:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:19:04,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:19:04,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-11-28 03:19:04,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471634226] [2020-11-28 03:19:04,889 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:19:04,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:19:04,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-28 03:19:04,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2020-11-28 03:19:04,891 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. cyclomatic complexity: 7 Second operand 22 states. [2020-11-28 03:19:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:19:05,129 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-28 03:19:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-28 03:19:05,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2020-11-28 03:19:05,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:19:05,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2020-11-28 03:19:05,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:19:05,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:19:05,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:19:05,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:19:05,132 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:19:05,132 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:19:05,132 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:19:05,132 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-28 03:19:05,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-28 03:19:05,132 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:19:05,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-28 03:19:05,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:19:05 BoogieIcfgContainer [2020-11-28 03:19:05,138 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:19:05,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:19:05,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:19:05,138 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:19:05,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:52" (3/4) ... [2020-11-28 03:19:05,145 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-28 03:19:05,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:19:05,146 INFO L168 Benchmark]: Toolchain (without parser) took 13760.03 ms. Allocated memory was 88.1 MB in the beginning and 188.7 MB in the end (delta: 100.7 MB). Free memory was 51.6 MB in the beginning and 114.7 MB in the end (delta: -63.1 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:19:05,146 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 88.1 MB. Free memory was 68.9 MB in the beginning and 68.9 MB in the end (delta: 37.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:19:05,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.45 ms. Allocated memory is still 88.1 MB. Free memory was 51.4 MB in the beginning and 55.9 MB in the end (delta: -4.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:19:05,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.51 ms. Allocated memory is still 88.1 MB. Free memory was 55.9 MB in the beginning and 54.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:19:05,147 INFO L168 Benchmark]: Boogie Preprocessor took 22.57 ms. Allocated memory is still 88.1 MB. Free memory was 54.1 MB in the beginning and 53.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:19:05,148 INFO L168 Benchmark]: RCFGBuilder took 335.11 ms. Allocated memory is still 88.1 MB. Free memory was 53.0 MB in the beginning and 40.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:19:05,148 INFO L168 Benchmark]: BuchiAutomizer took 12919.77 ms. Allocated memory was 88.1 MB in the beginning and 188.7 MB in the end (delta: 100.7 MB). Free memory was 40.1 MB in the beginning and 114.7 MB in the end (delta: -74.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:19:05,149 INFO L168 Benchmark]: Witness Printer took 7.19 ms. Allocated memory is still 188.7 MB. Free memory is still 114.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:19:05,152 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.20 ms. Allocated memory is still 88.1 MB. Free memory was 68.9 MB in the beginning and 68.9 MB in the end (delta: 37.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 428.45 ms. Allocated memory is still 88.1 MB. Free memory was 51.4 MB in the beginning and 55.9 MB in the end (delta: -4.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.51 ms. Allocated memory is still 88.1 MB. Free memory was 55.9 MB in the beginning and 54.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.57 ms. Allocated memory is still 88.1 MB. Free memory was 54.1 MB in the beginning and 53.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 335.11 ms. Allocated memory is still 88.1 MB. Free memory was 53.0 MB in the beginning and 40.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 12919.77 ms. Allocated memory was 88.1 MB in the beginning and 188.7 MB in the end (delta: 100.7 MB). Free memory was 40.1 MB in the beginning and 114.7 MB in the end (delta: -74.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. * Witness Printer took 7.19 ms. Allocated memory is still 188.7 MB. Free memory is still 114.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 21 and consists of 14 locations. 11 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.8s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 9.5s. Construction of modules took 1.1s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/90 HoareTripleCheckerStatistics: 73 SDtfs, 75 SDslu, 131 SDs, 0 SdLazy, 1313 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax111 hnf100 lsp85 ukn72 mio100 lsp42 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...