./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/test27-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test27-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2292364e3df3925555991c57490c078c89b959e0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 20:10:29,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:10:29,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:10:29,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:10:29,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:10:29,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:10:29,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:10:29,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:10:29,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:10:29,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:10:29,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:10:29,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:10:29,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:10:29,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:10:29,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:10:29,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:10:29,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:10:29,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:10:29,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:10:29,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:10:29,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:10:29,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:10:29,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:10:29,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:10:29,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:10:29,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:10:29,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:10:29,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:10:29,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:10:29,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:10:29,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:10:29,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:10:29,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:10:29,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:10:29,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:10:29,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:10:29,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:10:29,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:10:29,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:10:29,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:10:29,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:10:29,739 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 20:10:29,764 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:10:29,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:10:29,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:10:29,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:10:29,767 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:10:29,767 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 20:10:29,767 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 20:10:29,768 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 20:10:29,768 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 20:10:29,769 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 20:10:29,769 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 20:10:29,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:10:29,770 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:10:29,770 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 20:10:29,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:10:29,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:10:29,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:10:29,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 20:10:29,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 20:10:29,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 20:10:29,774 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:10:29,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:10:29,775 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 20:10:29,775 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:10:29,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 20:10:29,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:10:29,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:10:29,776 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 20:10:29,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:10:29,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:10:29,778 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:10:29,779 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 20:10:29,780 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 20:10:29,781 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_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/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_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2292364e3df3925555991c57490c078c89b959e0 [2020-11-29 20:10:30,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:10:30,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:10:30,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:10:30,129 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:10:30,129 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:10:30,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/test27-2.c [2020-11-29 20:10:30,193 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/data/1604b00ee/38158fc284264c1c961daf425b4c7346/FLAG16eec7ab7 [2020-11-29 20:10:30,720 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:10:30,721 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/sv-benchmarks/c/ldv-regression/test27-2.c [2020-11-29 20:10:30,727 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/data/1604b00ee/38158fc284264c1c961daf425b4c7346/FLAG16eec7ab7 [2020-11-29 20:10:31,105 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/data/1604b00ee/38158fc284264c1c961daf425b4c7346 [2020-11-29 20:10:31,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:10:31,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:10:31,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:10:31,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:10:31,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:10:31,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3505598c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31, skipping insertion in model container [2020-11-29 20:10:31,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:10:31,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:10:31,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:10:31,385 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:10:31,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:10:31,420 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:10:31,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31 WrapperNode [2020-11-29 20:10:31,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:10:31,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:10:31,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:10:31,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:10:31,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:10:31,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:10:31,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:10:31,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:10:31,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... [2020-11-29 20:10:31,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:10:31,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:10:31,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:10:31,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:10:31,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-29 20:10:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:10:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-29 20:10:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:10:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 20:10:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:10:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:10:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 20:10:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 20:10:32,171 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:10:32,173 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-11-29 20:10:32,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:10:32 BoogieIcfgContainer [2020-11-29 20:10:32,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:10:32,178 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 20:10:32,179 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 20:10:32,182 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 20:10:32,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 20:10:32,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 08:10:31" (1/3) ... [2020-11-29 20:10:32,185 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63447c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 08:10:32, skipping insertion in model container [2020-11-29 20:10:32,189 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 20:10:32,189 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:10:31" (2/3) ... [2020-11-29 20:10:32,190 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63447c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 08:10:32, skipping insertion in model container [2020-11-29 20:10:32,190 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 20:10:32,191 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:10:32" (3/3) ... [2020-11-29 20:10:32,192 INFO L373 chiAutomizerObserver]: Analyzing ICFG test27-2.c [2020-11-29 20:10:32,260 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 20:10:32,260 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 20:10:32,260 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 20:10:32,261 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:10:32,261 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:10:32,261 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 20:10:32,261 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:10:32,261 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 20:10:32,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-11-29 20:10:32,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-11-29 20:10:32,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:10:32,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:10:32,293 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:10:32,293 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:10:32,293 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 20:10:32,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-11-29 20:10:32,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-11-29 20:10:32,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:10:32,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:10:32,296 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:10:32,296 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:10:32,303 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 4#L29-3true [2020-11-29 20:10:32,304 INFO L796 eck$LassoCheckResult]: Loop: 4#L29-3true assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 6#L29-2true main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 4#L29-3true [2020-11-29 20:10:32,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:32,310 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 20:10:32,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:32,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417410867] [2020-11-29 20:10:32,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:32,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:32,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:32,467 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:10:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-29 20:10:32,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:32,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498754931] [2020-11-29 20:10:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:32,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:32,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:32,497 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:10:32,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:32,499 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-29 20:10:32,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:32,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281425572] [2020-11-29 20:10:32,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:32,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:32,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:32,669 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:10:32,784 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-29 20:10:32,862 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:10:32,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:10:32,955 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:10:33,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:10:33,046 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 20:10:33,046 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:178 [2020-11-29 20:10:34,046 WARN L193 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2020-11-29 20:10:34,355 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-29 20:10:34,366 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 20:10:34,367 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 20:10:34,367 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 20:10:34,367 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 20:10:34,368 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 20:10:34,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:34,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 20:10:34,368 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 20:10:34,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-2.c_Iteration1_Lasso [2020-11-29 20:10:34,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 20:10:34,368 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 20:10:34,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:34,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,056 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-11-29 20:10:35,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:10:35,846 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 20:10:35,850 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:35,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:35,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:35,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:35,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:35,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:35,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:35,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:35,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:10:35,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:35,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:35,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:35,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:35,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:35,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:35,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:35,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:35,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:35,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:35,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:35,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:35,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:35,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:35,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:35,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:35,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:10:35,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:35,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:35,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:35,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:35,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:35,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:35,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:36,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:10:36,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:10:36,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:36,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:36,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:36,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:36,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:10:36,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:36,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:36,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:10:36,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:10:36,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:10:36,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:10:36,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/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) [2020-11-29 20:10:36,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:10:36,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:36,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:36,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:10:36,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:36,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:36,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:10:36,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:10:36,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:36,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:36,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:10:36,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:10:36,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:36,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:36,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:36,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:36,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:10:36,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:36,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:36,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:36,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:10:36,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:36,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:36,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:36,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:10:36,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:10:36,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:37,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:37,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:37,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:37,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:37,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:37,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:37,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:37,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:37,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:10:37,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:10:37,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:10:37,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:10:37,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:10:37,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:10:37,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 20:10:37,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 20:10:37,308 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-11-29 20:10:37,308 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:10:37,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:10:37,321 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 20:10:37,322 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 20:10:37,322 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#dummies~0.base)_1) = -8*ULTIMATE.start_main_~j~0 + 19*v_rep(select #length ULTIMATE.start_main_~#dummies~0.base)_1 Supporting invariants [] [2020-11-29 20:10:37,481 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2020-11-29 20:10:37,487 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 20:10:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:10:37,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 20:10:37,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:10:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:10:37,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 20:10:37,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:10:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:37,618 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-29 20:10:37,619 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2020-11-29 20:10:37,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 40 states and 57 transitions. Complement of second has 8 states. [2020-11-29 20:10:37,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 20:10:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 20:10:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-11-29 20:10:37,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-29 20:10:37,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:10:37,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-29 20:10:37,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:10:37,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-29 20:10:37,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:10:37,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 57 transitions. [2020-11-29 20:10:37,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:37,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 9 states and 11 transitions. [2020-11-29 20:10:37,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-29 20:10:37,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:10:37,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-11-29 20:10:37,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:10:37,753 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-11-29 20:10:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-11-29 20:10:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-11-29 20:10:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-29 20:10:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-11-29 20:10:37,778 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-11-29 20:10:37,778 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-11-29 20:10:37,778 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 20:10:37,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-11-29 20:10:37,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:37,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:10:37,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:10:37,780 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-29 20:10:37,780 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:10:37,780 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 217#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 218#L29-3 assume !(main_~j~0 < 10); 221#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 219#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 220#L44-3 [2020-11-29 20:10:37,781 INFO L796 eck$LassoCheckResult]: Loop: 220#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 225#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 220#L44-3 [2020-11-29 20:10:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2020-11-29 20:10:37,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:37,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257172777] [2020-11-29 20:10:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:10:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:37,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257172777] [2020-11-29 20:10:37,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:10:37,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:10:37,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056591848] [2020-11-29 20:10:37,880 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:10:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2020-11-29 20:10:37,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:37,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711196967] [2020-11-29 20:10:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:37,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:37,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:37,900 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:10:37,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:10:37,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:10:37,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:10:37,932 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-11-29 20:10:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:10:37,949 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-11-29 20:10:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:10:37,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-11-29 20:10:37,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:37,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2020-11-29 20:10:37,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:10:37,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:10:37,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-11-29 20:10:37,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:10:37,952 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-11-29 20:10:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-11-29 20:10:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-11-29 20:10:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-29 20:10:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-11-29 20:10:37,954 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-11-29 20:10:37,954 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-11-29 20:10:37,954 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 20:10:37,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-11-29 20:10:37,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:37,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:10:37,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:10:37,955 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:10:37,955 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:10:37,955 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 242#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 243#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 244#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 245#L29-3 assume !(main_~j~0 < 10); 246#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 247#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 248#L44-3 [2020-11-29 20:10:37,955 INFO L796 eck$LassoCheckResult]: Loop: 248#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 250#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 248#L44-3 [2020-11-29 20:10:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2020-11-29 20:10:37,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:37,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012567449] [2020-11-29 20:10:37,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:10:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:38,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012567449] [2020-11-29 20:10:38,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432690298] [2020-11-29 20:10:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:10:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:10:38,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 20:10:38,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:10:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:38,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:10:38,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 20:10:38,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378668437] [2020-11-29 20:10:38,118 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:10:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:38,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2020-11-29 20:10:38,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:38,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709952452] [2020-11-29 20:10:38,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:38,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:38,124 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:38,126 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:10:38,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:10:38,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:10:38,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:10:38,159 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 5 states. [2020-11-29 20:10:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:10:38,184 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-11-29 20:10:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:10:38,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-11-29 20:10:38,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:38,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2020-11-29 20:10:38,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:10:38,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:10:38,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-11-29 20:10:38,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:10:38,186 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-11-29 20:10:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-11-29 20:10:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-11-29 20:10:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-11-29 20:10:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-11-29 20:10:38,188 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-11-29 20:10:38,188 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-11-29 20:10:38,188 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 20:10:38,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-11-29 20:10:38,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:38,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:10:38,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:10:38,189 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-11-29 20:10:38,189 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:10:38,189 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 289#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 290#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 291#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 292#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 293#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 299#L29-3 assume !(main_~j~0 < 10); 298#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 294#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 295#L44-3 [2020-11-29 20:10:38,190 INFO L796 eck$LassoCheckResult]: Loop: 295#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 297#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 295#L44-3 [2020-11-29 20:10:38,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:38,190 INFO L82 PathProgramCache]: Analyzing trace with hash -367607132, now seen corresponding path program 2 times [2020-11-29 20:10:38,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:38,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906162551] [2020-11-29 20:10:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:10:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:38,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906162551] [2020-11-29 20:10:38,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779898861] [2020-11-29 20:10:38,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:10:38,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:10:38,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:10:38,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 20:10:38,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:10:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:38,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:10:38,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 20:10:38,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126974616] [2020-11-29 20:10:38,429 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:10:38,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2020-11-29 20:10:38,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:38,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766909962] [2020-11-29 20:10:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:38,435 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:38,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:38,445 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:10:38,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:10:38,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:10:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:10:38,477 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 6 states. [2020-11-29 20:10:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:10:38,505 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-11-29 20:10:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:10:38,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2020-11-29 20:10:38,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:38,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2020-11-29 20:10:38,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:10:38,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:10:38,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2020-11-29 20:10:38,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:10:38,508 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-11-29 20:10:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2020-11-29 20:10:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-11-29 20:10:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-29 20:10:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-11-29 20:10:38,510 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-11-29 20:10:38,510 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-11-29 20:10:38,510 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 20:10:38,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-11-29 20:10:38,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:38,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:10:38,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:10:38,511 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2020-11-29 20:10:38,511 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:10:38,512 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 347#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 348#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 349#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 355#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 359#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 350#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 351#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 358#L29-3 assume !(main_~j~0 < 10); 357#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 352#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 353#L44-3 [2020-11-29 20:10:38,512 INFO L796 eck$LassoCheckResult]: Loop: 353#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 356#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 353#L44-3 [2020-11-29 20:10:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479198, now seen corresponding path program 3 times [2020-11-29 20:10:38,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:38,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592024718] [2020-11-29 20:10:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:10:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:38,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592024718] [2020-11-29 20:10:38,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705289457] [2020-11-29 20:10:38,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:10:38,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-29 20:10:38,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:10:38,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:10:38,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:10:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:38,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:10:38,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 20:10:38,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348600367] [2020-11-29 20:10:38,933 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:10:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:38,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2020-11-29 20:10:38,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:38,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916873836] [2020-11-29 20:10:38,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:38,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:38,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:38,951 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:10:38,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:10:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:10:38,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:10:38,992 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 7 states. [2020-11-29 20:10:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:10:39,031 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-11-29 20:10:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:10:39,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2020-11-29 20:10:39,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:39,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2020-11-29 20:10:39,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:10:39,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:10:39,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2020-11-29 20:10:39,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:10:39,034 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-11-29 20:10:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2020-11-29 20:10:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-11-29 20:10:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-29 20:10:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-11-29 20:10:39,036 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-11-29 20:10:39,036 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-11-29 20:10:39,036 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 20:10:39,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-11-29 20:10:39,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:39,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:10:39,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:10:39,037 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2020-11-29 20:10:39,037 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:10:39,037 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 416#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 417#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 418#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 419#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 420#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 424#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 430#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 429#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 428#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 427#L29-3 assume !(main_~j~0 < 10); 426#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 421#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 422#L44-3 [2020-11-29 20:10:39,038 INFO L796 eck$LassoCheckResult]: Loop: 422#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 425#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 422#L44-3 [2020-11-29 20:10:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 4 times [2020-11-29 20:10:39,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:39,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92589705] [2020-11-29 20:10:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:10:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:39,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92589705] [2020-11-29 20:10:39,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944079760] [2020-11-29 20:10:39,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:10:59,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:10:59,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:10:59,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 20:10:59,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:10:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:59,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:10:59,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 20:10:59,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166506619] [2020-11-29 20:10:59,299 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:10:59,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:59,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 5 times [2020-11-29 20:10:59,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:59,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068392916] [2020-11-29 20:10:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:59,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:10:59,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:10:59,310 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:10:59,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:10:59,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 20:10:59,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-29 20:10:59,337 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 8 states. [2020-11-29 20:10:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:10:59,379 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-11-29 20:10:59,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:10:59,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2020-11-29 20:10:59,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:59,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2020-11-29 20:10:59,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:10:59,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:10:59,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2020-11-29 20:10:59,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:10:59,383 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-11-29 20:10:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2020-11-29 20:10:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-29 20:10:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-29 20:10:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-11-29 20:10:59,385 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-11-29 20:10:59,385 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-11-29 20:10:59,385 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 20:10:59,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2020-11-29 20:10:59,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:10:59,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:10:59,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:10:59,387 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2020-11-29 20:10:59,387 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:10:59,387 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 496#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 497#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 498#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 499#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 500#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 504#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 512#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 511#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 510#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 509#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 508#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 507#L29-3 assume !(main_~j~0 < 10); 506#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 501#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 502#L44-3 [2020-11-29 20:10:59,387 INFO L796 eck$LassoCheckResult]: Loop: 502#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 505#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 502#L44-3 [2020-11-29 20:10:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:10:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904350, now seen corresponding path program 5 times [2020-11-29 20:10:59,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:10:59,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275708125] [2020-11-29 20:10:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:10:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:10:59,568 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:10:59,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275708125] [2020-11-29 20:10:59,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296361189] [2020-11-29 20:10:59,569 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:11:00,407 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-29 20:11:00,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:11:00,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 20:11:00,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:11:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:00,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:11:00,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-11-29 20:11:00,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242266903] [2020-11-29 20:11:00,462 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:11:00,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:00,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 6 times [2020-11-29 20:11:00,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:00,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75536211] [2020-11-29 20:11:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:00,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:00,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:00,476 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:11:00,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:11:00,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 20:11:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:11:00,515 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 9 states. [2020-11-29 20:11:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:11:00,561 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-11-29 20:11:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 20:11:00,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2020-11-29 20:11:00,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:00,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2020-11-29 20:11:00,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:11:00,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:11:00,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2020-11-29 20:11:00,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:11:00,564 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-11-29 20:11:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2020-11-29 20:11:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-11-29 20:11:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-29 20:11:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-11-29 20:11:00,566 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-11-29 20:11:00,566 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-11-29 20:11:00,566 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 20:11:00,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2020-11-29 20:11:00,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:00,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:11:00,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:11:00,567 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2020-11-29 20:11:00,567 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:11:00,567 INFO L794 eck$LassoCheckResult]: Stem: 594#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 587#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 588#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 589#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 590#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 591#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 595#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 605#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 604#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 603#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 602#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 601#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 600#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 599#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 598#L29-3 assume !(main_~j~0 < 10); 597#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 592#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 593#L44-3 [2020-11-29 20:11:00,568 INFO L796 eck$LassoCheckResult]: Loop: 593#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 596#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 593#L44-3 [2020-11-29 20:11:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295068, now seen corresponding path program 6 times [2020-11-29 20:11:00,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:00,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504708205] [2020-11-29 20:11:00,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:11:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:00,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504708205] [2020-11-29 20:11:00,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954042191] [2020-11-29 20:11:00,669 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:11:01,758 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-11-29 20:11:01,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:11:01,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 20:11:01,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:11:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:01,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:11:01,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-29 20:11:01,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802987277] [2020-11-29 20:11:01,810 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:11:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 7 times [2020-11-29 20:11:01,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:01,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340360578] [2020-11-29 20:11:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:01,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:01,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:01,821 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:11:01,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:11:01,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 20:11:01,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-29 20:11:01,850 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 10 states. [2020-11-29 20:11:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:11:01,893 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-11-29 20:11:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 20:11:01,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2020-11-29 20:11:01,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:01,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2020-11-29 20:11:01,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:11:01,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:11:01,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2020-11-29 20:11:01,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:11:01,896 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-11-29 20:11:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2020-11-29 20:11:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-11-29 20:11:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-29 20:11:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-11-29 20:11:01,899 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-11-29 20:11:01,899 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-11-29 20:11:01,899 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 20:11:01,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2020-11-29 20:11:01,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:01,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:11:01,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:11:01,900 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2020-11-29 20:11:01,900 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:11:01,901 INFO L794 eck$LassoCheckResult]: Stem: 696#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 689#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 690#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 691#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 692#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 693#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 697#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 709#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 708#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 707#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 706#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 705#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 704#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 703#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 702#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 701#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 700#L29-3 assume !(main_~j~0 < 10); 699#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 694#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 695#L44-3 [2020-11-29 20:11:01,901 INFO L796 eck$LassoCheckResult]: Loop: 695#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 698#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 695#L44-3 [2020-11-29 20:11:01,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:01,901 INFO L82 PathProgramCache]: Analyzing trace with hash 72219098, now seen corresponding path program 7 times [2020-11-29 20:11:01,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:01,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729060278] [2020-11-29 20:11:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:11:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:02,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729060278] [2020-11-29 20:11:02,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825302215] [2020-11-29 20:11:02,027 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:11:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:11:02,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 20:11:02,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:11:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:02,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:11:02,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-29 20:11:02,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800133984] [2020-11-29 20:11:02,171 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:11:02,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:02,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 8 times [2020-11-29 20:11:02,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:02,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192020323] [2020-11-29 20:11:02,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:02,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:02,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:02,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:11:02,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:11:02,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 20:11:02,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-29 20:11:02,220 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 11 states. [2020-11-29 20:11:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:11:02,280 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-11-29 20:11:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:11:02,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2020-11-29 20:11:02,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:02,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2020-11-29 20:11:02,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:11:02,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:11:02,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2020-11-29 20:11:02,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:11:02,282 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-11-29 20:11:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2020-11-29 20:11:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-11-29 20:11:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-29 20:11:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-11-29 20:11:02,284 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-11-29 20:11:02,285 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-11-29 20:11:02,285 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 20:11:02,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2020-11-29 20:11:02,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:02,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:11:02,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:11:02,290 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2020-11-29 20:11:02,290 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:11:02,291 INFO L794 eck$LassoCheckResult]: Stem: 809#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 802#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 803#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 804#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 805#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 806#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 811#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 824#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 823#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 822#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 821#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 820#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 819#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 818#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 817#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 816#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 815#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 814#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 813#L29-3 assume !(main_~j~0 < 10); 812#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 807#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 808#L44-3 [2020-11-29 20:11:02,292 INFO L796 eck$LassoCheckResult]: Loop: 808#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 810#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 808#L44-3 [2020-11-29 20:11:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:02,293 INFO L82 PathProgramCache]: Analyzing trace with hash 684732824, now seen corresponding path program 8 times [2020-11-29 20:11:02,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:02,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734468439] [2020-11-29 20:11:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:11:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:02,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734468439] [2020-11-29 20:11:02,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876532427] [2020-11-29 20:11:02,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:11:02,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:11:02,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:11:02,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 20:11:02,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:11:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:02,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:11:02,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-29 20:11:02,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982883364] [2020-11-29 20:11:02,586 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:11:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 9 times [2020-11-29 20:11:02,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:02,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209866032] [2020-11-29 20:11:02,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:02,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:02,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:02,592 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:11:02,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:11:02,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 20:11:02,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:11:02,627 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 12 states. [2020-11-29 20:11:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:11:02,695 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-11-29 20:11:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:11:02,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2020-11-29 20:11:02,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:02,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2020-11-29 20:11:02,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:11:02,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:11:02,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2020-11-29 20:11:02,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:11:02,699 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-11-29 20:11:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2020-11-29 20:11:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-11-29 20:11:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-29 20:11:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-11-29 20:11:02,701 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-11-29 20:11:02,701 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-11-29 20:11:02,701 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 20:11:02,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2020-11-29 20:11:02,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:02,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:11:02,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:11:02,702 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1] [2020-11-29 20:11:02,702 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:11:02,702 INFO L794 eck$LassoCheckResult]: Stem: 933#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 926#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 927#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 928#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 929#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 930#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 934#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 950#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 949#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 948#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 947#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 946#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 945#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 944#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 943#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 942#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 941#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 940#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 939#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 938#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 937#L29-3 assume !(main_~j~0 < 10); 936#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 931#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 932#L44-3 [2020-11-29 20:11:02,703 INFO L796 eck$LassoCheckResult]: Loop: 932#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 935#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 932#L44-3 [2020-11-29 20:11:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 899903958, now seen corresponding path program 9 times [2020-11-29 20:11:02,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:02,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381583737] [2020-11-29 20:11:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:11:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:02,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381583737] [2020-11-29 20:11:02,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580509809] [2020-11-29 20:11:02,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:11:07,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-11-29 20:11:07,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:11:07,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 20:11:07,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:11:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:07,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:11:07,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-11-29 20:11:07,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074982510] [2020-11-29 20:11:07,516 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:11:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 10 times [2020-11-29 20:11:07,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:07,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343869495] [2020-11-29 20:11:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:07,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:07,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:07,523 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:11:07,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:11:07,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 20:11:07,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:11:07,552 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 13 states. [2020-11-29 20:11:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:11:07,624 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-11-29 20:11:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 20:11:07,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2020-11-29 20:11:07,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:07,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2020-11-29 20:11:07,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:11:07,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:11:07,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2020-11-29 20:11:07,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:11:07,627 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-11-29 20:11:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2020-11-29 20:11:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-11-29 20:11:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-29 20:11:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-11-29 20:11:07,629 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-11-29 20:11:07,629 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-11-29 20:11:07,629 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 20:11:07,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2020-11-29 20:11:07,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:11:07,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:11:07,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:11:07,631 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2020-11-29 20:11:07,631 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:11:07,631 INFO L794 eck$LassoCheckResult]: Stem: 1067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1060#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 1061#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1062#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1063#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1064#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1068#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1086#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1085#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1084#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1083#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1082#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1081#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1080#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1079#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1078#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1077#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1076#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1075#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1074#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1073#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1072#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1071#L29-3 assume !(main_~j~0 < 10); 1070#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1065#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 1066#L44-3 [2020-11-29 20:11:07,631 INFO L796 eck$LassoCheckResult]: Loop: 1066#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 1069#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 1066#L44-3 [2020-11-29 20:11:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 10 times [2020-11-29 20:11:07,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:07,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596603863] [2020-11-29 20:11:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:11:09,109 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2020-11-29 20:11:09,280 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2020-11-29 20:11:09,432 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2020-11-29 20:11:09,621 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 50 [2020-11-29 20:11:09,799 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2020-11-29 20:11:09,991 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2020-11-29 20:11:10,197 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2020-11-29 20:11:10,343 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 60 [2020-11-29 20:11:10,556 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2020-11-29 20:11:10,764 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2020-11-29 20:11:10,981 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 60 [2020-11-29 20:11:11,204 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2020-11-29 20:11:11,391 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2020-11-29 20:11:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:11,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596603863] [2020-11-29 20:11:11,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723130058] [2020-11-29 20:11:11,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d382d74-6e93-4ca8-b29e-0b7cde99c16d/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:11:11,866 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:11:11,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:11:11,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 94 conjunts are in the unsatisfiable core [2020-11-29 20:11:11,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:11:11,945 INFO L350 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2020-11-29 20:11:11,946 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2020-11-29 20:11:11,946 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:11,978 INFO L625 ElimStorePlain]: treesize reduction 12, result has 66.7 percent of original size [2020-11-29 20:11:11,979 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:11,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:24 [2020-11-29 20:11:12,070 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_100|], 36=[|v_#valid_129|]} [2020-11-29 20:11:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,096 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2020-11-29 20:11:12,096 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:12,195 INFO L625 ElimStorePlain]: treesize reduction 4, result has 96.1 percent of original size [2020-11-29 20:11:12,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:12,387 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-11-29 20:11:12,387 INFO L350 Elim1Store]: treesize reduction 66, result has 57.4 percent of original size [2020-11-29 20:11:12,387 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 127 [2020-11-29 20:11:12,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:11:12,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:11:12,403 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:12,514 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-11-29 20:11:12,515 INFO L625 ElimStorePlain]: treesize reduction 51, result has 61.9 percent of original size [2020-11-29 20:11:12,517 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:12,517 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:83 [2020-11-29 20:11:12,712 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-11-29 20:11:12,713 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:12,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:12,755 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-11-29 20:11:12,756 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:12,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:12,790 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:11:12,790 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:88 [2020-11-29 20:11:12,998 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 33 treesize of output 13 [2020-11-29 20:11:12,998 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:13,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:13,077 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:13,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:13,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:13,140 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-11-29 20:11:13,141 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:13,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:13,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:13,202 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2020-11-29 20:11:13,202 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:13,253 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:13,263 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:11:13,264 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:160, output treesize:106 [2020-11-29 20:11:13,451 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_32|], 6=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2020-11-29 20:11:13,456 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:13,565 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-29 20:11:13,565 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:13,571 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:13,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:13,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:13,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:13,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:13,660 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2020-11-29 20:11:13,660 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:13,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:13,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:13,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:13,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:13,769 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2020-11-29 20:11:13,770 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:13,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:13,833 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:11:13,833 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:178, output treesize:124 [2020-11-29 20:11:14,040 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_33|, |v_#memory_$Pointer$.offset_33|], 12=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|]} [2020-11-29 20:11:14,044 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:14,215 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-29 20:11:14,215 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:14,219 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:14,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:14,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,364 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2020-11-29 20:11:14,364 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:14,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:14,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:14,483 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2020-11-29 20:11:14,483 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:14,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:14,546 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:11:14,546 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:196, output treesize:142 [2020-11-29 20:11:14,786 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_34|, |v_#memory_$Pointer$.base_34|], 20=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_43|]} [2020-11-29 20:11:14,789 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:14,905 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-29 20:11:14,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:14,926 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:15,145 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-29 20:11:15,145 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:15,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,203 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2020-11-29 20:11:15,204 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:15,309 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-29 20:11:15,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:15,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:15,328 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2020-11-29 20:11:15,329 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:15,410 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:15,412 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:11:15,412 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:214, output treesize:160 [2020-11-29 20:11:15,750 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-11-29 20:11:15,760 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_35|], 30=[|v_#memory_$Pointer$.base_44|, |v_#memory_$Pointer$.offset_44|]} [2020-11-29 20:11:15,765 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:15,902 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-29 20:11:15,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:15,906 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:16,021 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-29 20:11:16,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:16,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,077 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2020-11-29 20:11:16,078 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:16,224 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-29 20:11:16,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:16,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,263 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2020-11-29 20:11:16,265 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:16,344 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:16,345 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:11:16,345 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:238, output treesize:184 [2020-11-29 20:11:16,665 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_36|, |v_#memory_$Pointer$.base_36|], 42=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_45|]} [2020-11-29 20:11:16,671 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:16,808 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-29 20:11:16,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:16,812 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:16,916 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-29 20:11:16,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:16,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:16,951 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 95 [2020-11-29 20:11:16,952 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:17,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:17,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,077 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 95 [2020-11-29 20:11:17,078 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:17,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:17,172 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:11:17,172 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:250, output treesize:196 [2020-11-29 20:11:17,523 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_37|], 56=[|v_#memory_$Pointer$.offset_46|, |v_#memory_$Pointer$.base_46|]} [2020-11-29 20:11:17,527 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:17,681 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 20:11:17,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:17,687 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:17,841 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-29 20:11:17,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:17,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:17,887 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 110 [2020-11-29 20:11:17,889 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:18,013 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-29 20:11:18,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:18,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:18,092 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 110 [2020-11-29 20:11:18,093 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:18,208 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-29 20:11:18,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:18,212 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:11:18,212 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:274, output treesize:220 [2020-11-29 20:11:18,564 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|], 72=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_47|]} [2020-11-29 20:11:18,568 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:18,904 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-29 20:11:18,905 INFO L625 ElimStorePlain]: treesize reduction 3, result has 99.0 percent of original size [2020-11-29 20:11:18,909 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:19,083 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 20:11:19,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:19,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,201 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 119 [2020-11-29 20:11:19,202 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:19,360 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 20:11:19,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:19,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:19,411 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 119 [2020-11-29 20:11:19,413 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:19,522 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-11-29 20:11:19,523 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:19,524 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:11:19,524 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:289, output treesize:232 [2020-11-29 20:11:19,752 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-29 20:11:19,976 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-29 20:11:24,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:24,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:24,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:24,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:24,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:24,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:24,989 INFO L244 Elim1Store]: Index analysis took 167 ms [2020-11-29 20:11:25,060 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:25,061 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 47 treesize of output 155 [2020-11-29 20:11:25,062 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:26,034 WARN L193 SmtUtils]: Spent 971.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2020-11-29 20:11:26,034 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:26,038 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_54|], 2=[|v_#memory_int_52|, |v_#memory_int_53|, |#memory_int|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|], 90=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_48|]} [2020-11-29 20:11:26,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:26,184 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 11 [2020-11-29 20:11:26,184 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:26,962 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-29 20:11:26,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:26,992 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2020-11-29 20:11:26,992 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:27,471 WARN L193 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-11-29 20:11:27,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:27,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:27,510 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 20:11:27,510 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:28,062 WARN L193 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-11-29 20:11:28,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:28,085 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2020-11-29 20:11:28,085 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:28,496 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2020-11-29 20:11:28,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:28,505 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:28,905 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-11-29 20:11:28,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:28,924 INFO L545 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:29,288 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-29 20:11:29,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:29,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:29,463 INFO L244 Elim1Store]: Index analysis took 161 ms [2020-11-29 20:11:29,677 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-11-29 20:11:29,678 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:29,678 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 44 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 263 treesize of output 438 [2020-11-29 20:11:29,680 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:30,344 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 137 [2020-11-29 20:11:30,345 INFO L625 ElimStorePlain]: treesize reduction 277, result has 62.9 percent of original size [2020-11-29 20:11:30,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:11:30,652 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-11-29 20:11:30,652 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:11:30,652 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 44 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 247 treesize of output 434 [2020-11-29 20:11:30,654 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-11-29 20:11:31,108 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 133 [2020-11-29 20:11:31,109 INFO L625 ElimStorePlain]: treesize reduction 277, result has 56.0 percent of original size [2020-11-29 20:11:31,113 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 20:11:31,114 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 15 variables, input treesize:558, output treesize:406 [2020-11-29 20:11:31,488 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-11-29 20:11:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:11:31,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:11:31,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 40 [2020-11-29 20:11:31,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348959986] [2020-11-29 20:11:31,505 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:11:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:11:31,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 11 times [2020-11-29 20:11:31,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:11:31,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707624977] [2020-11-29 20:11:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:11:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:31,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:11:31,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:11:31,512 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:11:31,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:11:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-11-29 20:11:31,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2020-11-29 20:11:31,571 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 42 states. [2020-11-29 20:11:32,193 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-11-29 20:11:32,387 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-11-29 20:11:32,613 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2020-11-29 20:11:32,816 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2020-11-29 20:11:33,051 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2020-11-29 20:11:33,273 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2020-11-29 20:11:33,558 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2020-11-29 20:11:33,830 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2020-11-29 20:11:34,154 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 77 [2020-11-29 20:11:34,425 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2020-11-29 20:11:34,765 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2020-11-29 20:11:35,095 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2020-11-29 20:11:35,496 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 89 [2020-11-29 20:11:35,823 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 89 [2020-11-29 20:11:36,233 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 94 [2020-11-29 20:11:36,557 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 95 [2020-11-29 20:11:36,963 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 101 [2020-11-29 20:11:37,304 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 101 [2020-11-29 20:11:38,769 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 129 [2020-11-29 20:11:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:11:38,770 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-11-29 20:11:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-29 20:11:38,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 24 transitions. [2020-11-29 20:11:38,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 20:11:38,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2020-11-29 20:11:38,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 20:11:38,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 20:11:38,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 20:11:38,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:11:38,771 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 20:11:38,771 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 20:11:38,771 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 20:11:38,771 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-29 20:11:38,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 20:11:38,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 20:11:38,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 20:11:38,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 08:11:38 BoogieIcfgContainer [2020-11-29 20:11:38,776 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 20:11:38,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:11:38,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:11:38,777 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:11:38,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:10:32" (3/4) ... [2020-11-29 20:11:38,781 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 20:11:38,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:11:38,782 INFO L168 Benchmark]: Toolchain (without parser) took 67672.90 ms. Allocated memory was 119.5 MB in the beginning and 270.5 MB in the end (delta: 151.0 MB). Free memory was 90.7 MB in the beginning and 128.3 MB in the end (delta: -37.7 MB). Peak memory consumption was 113.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:11:38,783 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 81.8 MB. Free memory was 43.7 MB in the beginning and 43.7 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:11:38,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.40 ms. Allocated memory is still 119.5 MB. Free memory was 90.3 MB in the beginning and 97.1 MB in the end (delta: -6.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:11:38,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.17 ms. Allocated memory is still 119.5 MB. Free memory was 97.1 MB in the beginning and 95.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:11:38,783 INFO L168 Benchmark]: Boogie Preprocessor took 29.72 ms. Allocated memory is still 119.5 MB. Free memory was 95.4 MB in the beginning and 94.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:11:38,785 INFO L168 Benchmark]: RCFGBuilder took 684.37 ms. Allocated memory is still 119.5 MB. Free memory was 93.7 MB in the beginning and 72.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 20:11:38,785 INFO L168 Benchmark]: BuchiAutomizer took 66598.10 ms. Allocated memory was 119.5 MB in the beginning and 270.5 MB in the end (delta: 151.0 MB). Free memory was 72.7 MB in the beginning and 129.4 MB in the end (delta: -56.7 MB). Peak memory consumption was 95.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:11:38,785 INFO L168 Benchmark]: Witness Printer took 4.12 ms. Allocated memory is still 270.5 MB. Free memory was 129.4 MB in the beginning and 128.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:11:38,787 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.28 ms. Allocated memory is still 81.8 MB. Free memory was 43.7 MB in the beginning and 43.7 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 311.40 ms. Allocated memory is still 119.5 MB. Free memory was 90.3 MB in the beginning and 97.1 MB in the end (delta: -6.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.17 ms. Allocated memory is still 119.5 MB. Free memory was 97.1 MB in the beginning and 95.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.72 ms. Allocated memory is still 119.5 MB. Free memory was 95.4 MB in the beginning and 94.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 684.37 ms. Allocated memory is still 119.5 MB. Free memory was 93.7 MB in the beginning and 72.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 66598.10 ms. Allocated memory was 119.5 MB in the beginning and 270.5 MB in the end (delta: 151.0 MB). Free memory was 72.7 MB in the beginning and 129.4 MB in the end (delta: -56.7 MB). Peak memory consumption was 95.1 MB. Max. memory is 16.1 GB. * Witness Printer took 4.12 ms. Allocated memory is still 270.5 MB. Free memory was 129.4 MB in the beginning and 128.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -8 * j + 19 * unknown-#length-unknown[dummies] and consists of 5 locations. 11 modules have a trivial ranking function, the largest among these consists of 42 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 66.5s and 13 iterations. TraceHistogramMax:10. Analysis of lassos took 58.4s. Construction of modules took 2.4s. Büchi inclusion checks took 5.4s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 81 SDslu, 199 SDs, 0 SdLazy, 688 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital419 mio100 ax100 hnf100 lsp95 ukn36 mio100 lsp44 div100 bol100 ite100 ukn100 eq169 hnf78 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...