./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test27-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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 dfe25ce750efb74d780ec4e5d4c6de923e91c57e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:55:00,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:55:00,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:55:00,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:55:00,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:55:00,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:55:00,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:55:00,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:55:00,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:55:00,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:55:00,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:55:00,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:55:00,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:55:00,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:55:00,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:55:00,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:55:00,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:55:00,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:55:00,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:55:00,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:55:00,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:55:00,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:55:00,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:55:00,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:55:00,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:55:00,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:55:00,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:55:00,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:55:00,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:55:00,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:55:00,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:55:00,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:55:00,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:55:00,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:55:00,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:55:00,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:55:00,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:55:00,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:55:00,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:55:00,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:55:00,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:55:00,720 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:55:00,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:55:00,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:55:00,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:55:00,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:55:00,746 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:55:00,746 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:55:00,746 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:55:00,746 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:55:00,747 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:55:00,747 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:55:00,747 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:55:00,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:55:00,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:55:00,747 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:55:00,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:55:00,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:55:00,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:55:00,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:55:00,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:55:00,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:55:00,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:55:00,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:55:00,748 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:55:00,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:55:00,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:55:00,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:55:00,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:55:00,749 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:55:00,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:55:00,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:55:00,750 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:55:00,751 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:55:00,751 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_adb1956f-60d3-49c6-91da-0dca75a91726/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 -> dfe25ce750efb74d780ec4e5d4c6de923e91c57e [2019-11-25 08:55:00,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:55:00,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:55:00,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:55:00,926 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:55:00,926 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:55:00,927 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/test27-2.c [2019-11-25 08:55:00,985 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/data/b2488699c/e117d3f78bf040679aabadb04600c411/FLAG169bd80de [2019-11-25 08:55:01,425 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:55:01,426 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/sv-benchmarks/c/ldv-regression/test27-2.c [2019-11-25 08:55:01,432 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/data/b2488699c/e117d3f78bf040679aabadb04600c411/FLAG169bd80de [2019-11-25 08:55:01,824 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/data/b2488699c/e117d3f78bf040679aabadb04600c411 [2019-11-25 08:55:01,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:55:01,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:55:01,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:01,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:55:01,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:55:01,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:01" (1/1) ... [2019-11-25 08:55:01,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3553fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:01, skipping insertion in model container [2019-11-25 08:55:01,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:01" (1/1) ... [2019-11-25 08:55:01,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:55:01,869 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:55:02,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:02,136 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:55:02,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:02,170 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:55:02,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02 WrapperNode [2019-11-25 08:55:02,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:02,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:02,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:55:02,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:55:02,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... [2019-11-25 08:55:02,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... [2019-11-25 08:55:02,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:02,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:55:02,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:55:02,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:55:02,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... [2019-11-25 08:55:02,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... [2019-11-25 08:55:02,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... [2019-11-25 08:55:02,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... [2019-11-25 08:55:02,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... [2019-11-25 08:55:02,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... [2019-11-25 08:55:02,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... [2019-11-25 08:55:02,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:55:02,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:55:02,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:55:02,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:55:02,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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 [2019-11-25 08:55:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:55:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:55:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:55:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:55:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:55:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:55:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:55:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:55:02,804 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:55:02,805 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:55:02,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:02 BoogieIcfgContainer [2019-11-25 08:55:02,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:55:02,806 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:55:02,807 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:55:02,811 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:55:02,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:55:02,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:55:01" (1/3) ... [2019-11-25 08:55:02,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dfdc6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:55:02, skipping insertion in model container [2019-11-25 08:55:02,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:55:02,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:02" (2/3) ... [2019-11-25 08:55:02,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dfdc6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:55:02, skipping insertion in model container [2019-11-25 08:55:02,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:55:02,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:02" (3/3) ... [2019-11-25 08:55:02,815 INFO L371 chiAutomizerObserver]: Analyzing ICFG test27-2.c [2019-11-25 08:55:02,859 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:55:02,859 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:55:02,859 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:55:02,859 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:55:02,859 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:55:02,860 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:55:02,860 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:55:02,860 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:55:02,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-25 08:55:02,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-25 08:55:02,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:02,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:02,898 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:55:02,898 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:02,899 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:55:02,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-25 08:55:02,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-25 08:55:02,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:02,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:02,901 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:55:02,901 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:02,908 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 15#L27-3true [2019-11-25 08:55:02,909 INFO L796 eck$LassoCheckResult]: Loop: 15#L27-3true assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 18#L27-2true main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15#L27-3true [2019-11-25 08:55:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:02,914 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-25 08:55:02,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:02,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923083641] [2019-11-25 08:55:02,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:03,044 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-25 08:55:03,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:03,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084427910] [2019-11-25 08:55:03,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:03,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-25 08:55:03,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:03,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465467073] [2019-11-25 08:55:03,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:03,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:03,263 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-25 08:55:03,307 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:03,409 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-25 08:55:03,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:03,422 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:03,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:03,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:03,513 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:178 [2019-11-25 08:55:03,875 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-25 08:55:03,984 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:55:03,985 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:55:03,985 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:55:03,985 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:55:03,986 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:55:03,986 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:03,986 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:55:03,986 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:55:03,986 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-2.c_Iteration1_Lasso [2019-11-25 08:55:03,987 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:55:03,987 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:55:04,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,224 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-25 08:55:04,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:55:04,727 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:55:04,733 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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 [2019-11-25 08:55:04,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:55:04,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:55:04,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:55:04,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:55:04,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:04,770 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 [2019-11-25 08:55:04,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:55:04,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:55:04,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:55:04,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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 [2019-11-25 08:55:04,781 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 [2019-11-25 08:55:04,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:55:04,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:55:04,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:55:04,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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 [2019-11-25 08:55:04,790 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 [2019-11-25 08:55:04,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:55:04,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:55:04,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:55:04,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:04,800 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 [2019-11-25 08:55:04,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:55:04,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:55:04,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:55:04,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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) [2019-11-25 08:55:04,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 [2019-11-25 08:55:04,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:55:04,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:04,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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 [2019-11-25 08:55:04,853 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 [2019-11-25 08:55:04,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:55:04,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:55:04,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:55:04,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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 [2019-11-25 08:55:04,863 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 [2019-11-25 08:55:04,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:55:04,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:55:04,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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 [2019-11-25 08:55:04,888 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 [2019-11-25 08:55:04,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:55:04,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:55:04,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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) [2019-11-25 08:55:04,913 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 [2019-11-25 08:55:04,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:55:04,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:55:04,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:04,941 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 [2019-11-25 08:55:04,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:55:04,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:55:04,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:04,971 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 [2019-11-25 08:55:04,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:55:04,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:55:04,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:55:04,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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 [2019-11-25 08:55:04,979 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 [2019-11-25 08:55:04,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:04,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:04,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:04,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:04,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:55:04,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:55:04,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/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) [2019-11-25 08:55:05,005 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 [2019-11-25 08:55:05,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:05,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:05,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:05,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:05,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:55:05,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:05,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:05,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:55:05,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:55:05,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:55:05,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:55:05,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:55:05,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:55:05,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:55:05,049 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:55:05,245 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-25 08:55:05,246 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:05,257 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:55:05,260 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:55:05,260 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:55:05,261 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#dummies~0.base)_1, ULTIMATE.start_main_~j~0) = 19*v_rep(select #length ULTIMATE.start_main_~#dummies~0.base)_1 - 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-25 08:55:05,315 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-25 08:55:05,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:55:05,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:05,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:55:05,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:05,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:55:05,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:05,422 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 [2019-11-25 08:55:05,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-25 08:55:05,526 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 56 transitions. Complement of second has 8 states. [2019-11-25 08:55:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:55:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:55:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-11-25 08:55:05,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-25 08:55:05,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:55:05,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-25 08:55:05,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:55:05,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-25 08:55:05,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:55:05,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2019-11-25 08:55:05,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:05,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2019-11-25 08:55:05,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:55:05,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:05,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-25 08:55:05,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:05,548 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-25 08:55:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-25 08:55:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-25 08:55:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-25 08:55:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-11-25 08:55:05,574 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-25 08:55:05,575 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-25 08:55:05,575 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:55:05,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-11-25 08:55:05,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:05,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:05,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:05,577 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:55:05,577 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:05,577 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 139#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 140#L27-3 assume !(main_~j~0 < 10); 142#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 143#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 144#L42-3 [2019-11-25 08:55:05,577 INFO L796 eck$LassoCheckResult]: Loop: 144#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 145#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 144#L42-3 [2019-11-25 08:55:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2019-11-25 08:55:05,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:05,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477513486] [2019-11-25 08:55:05,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:05,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477513486] [2019-11-25 08:55:05,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:05,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:05,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233921150] [2019-11-25 08:55:05,637 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2019-11-25 08:55:05,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:05,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69707464] [2019-11-25 08:55:05,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:05,653 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:05,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:05,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:05,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:05,683 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-25 08:55:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:05,693 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-25 08:55:05,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:05,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-25 08:55:05,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:05,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-25 08:55:05,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:05,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:05,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-25 08:55:05,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:05,695 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-25 08:55:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-25 08:55:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-11-25 08:55:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-25 08:55:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-25 08:55:05,696 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-25 08:55:05,696 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-25 08:55:05,697 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:55:05,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-25 08:55:05,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:05,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:05,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:05,698 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:05,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:05,698 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 164#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 165#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 171#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 172#L27-3 assume !(main_~j~0 < 10); 169#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 170#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 167#L42-3 [2019-11-25 08:55:05,698 INFO L796 eck$LassoCheckResult]: Loop: 167#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 168#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 167#L42-3 [2019-11-25 08:55:05,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:05,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2019-11-25 08:55:05,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:05,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029636081] [2019-11-25 08:55:05,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:05,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029636081] [2019-11-25 08:55:05,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371284805] [2019-11-25 08:55:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:05,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:55:05,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:05,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:05,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-25 08:55:05,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150878723] [2019-11-25 08:55:05,867 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2019-11-25 08:55:05,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:05,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802202334] [2019-11-25 08:55:05,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:05,876 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:05,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:05,905 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-11-25 08:55:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:05,931 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-25 08:55:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:55:05,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-25 08:55:05,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:05,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-11-25 08:55:05,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:05,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:05,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-11-25 08:55:05,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:05,934 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-25 08:55:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-11-25 08:55:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-25 08:55:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-25 08:55:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-25 08:55:05,936 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-25 08:55:05,936 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-25 08:55:05,936 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:55:05,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-25 08:55:05,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:05,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:05,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:05,937 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-25 08:55:05,937 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:05,938 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 211#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 212#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 218#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 219#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 220#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 221#L27-3 assume !(main_~j~0 < 10); 216#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 217#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 214#L42-3 [2019-11-25 08:55:05,938 INFO L796 eck$LassoCheckResult]: Loop: 214#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 215#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 214#L42-3 [2019-11-25 08:55:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:05,938 INFO L82 PathProgramCache]: Analyzing trace with hash -367607132, now seen corresponding path program 2 times [2019-11-25 08:55:05,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:05,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077963349] [2019-11-25 08:55:05,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:06,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077963349] [2019-11-25 08:55:06,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631063371] [2019-11-25 08:55:06,026 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:06,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:55:06,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:06,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:55:06,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:06,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:06,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-25 08:55:06,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983051451] [2019-11-25 08:55:06,107 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:06,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:06,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2019-11-25 08:55:06,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:06,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579582424] [2019-11-25 08:55:06,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:06,114 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:06,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:06,142 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-25 08:55:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:06,177 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-11-25 08:55:06,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:06,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2019-11-25 08:55:06,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:06,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2019-11-25 08:55:06,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:06,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:06,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2019-11-25 08:55:06,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:06,180 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-25 08:55:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2019-11-25 08:55:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-25 08:55:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-25 08:55:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-25 08:55:06,182 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-25 08:55:06,182 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-25 08:55:06,182 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:55:06,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-25 08:55:06,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:06,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:06,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:06,184 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2019-11-25 08:55:06,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:06,184 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 269#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 270#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 276#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 277#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 278#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 279#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 281#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 280#L27-3 assume !(main_~j~0 < 10); 272#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 273#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 274#L42-3 [2019-11-25 08:55:06,184 INFO L796 eck$LassoCheckResult]: Loop: 274#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 275#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 274#L42-3 [2019-11-25 08:55:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479198, now seen corresponding path program 3 times [2019-11-25 08:55:06,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:06,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473903] [2019-11-25 08:55:06,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:06,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473903] [2019-11-25 08:55:06,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909916350] [2019-11-25 08:55:06,245 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:06,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-25 08:55:06,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:06,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:55:06,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:06,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:06,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-25 08:55:06,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265336619] [2019-11-25 08:55:06,394 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:06,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:06,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2019-11-25 08:55:06,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:06,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344999051] [2019-11-25 08:55:06,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:06,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:06,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:06,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:55:06,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:06,427 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-25 08:55:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:06,458 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-11-25 08:55:06,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:55:06,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-11-25 08:55:06,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:06,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-11-25 08:55:06,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:06,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:06,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-11-25 08:55:06,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:06,461 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-25 08:55:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-11-25 08:55:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-25 08:55:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:55:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-25 08:55:06,463 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-25 08:55:06,463 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-25 08:55:06,463 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:55:06,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-25 08:55:06,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:06,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:06,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:06,464 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2019-11-25 08:55:06,464 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:06,464 INFO L794 eck$LassoCheckResult]: Stem: 340#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 338#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 339#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 345#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 346#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 347#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 348#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 352#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 351#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 350#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 349#L27-3 assume !(main_~j~0 < 10); 341#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 342#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 343#L42-3 [2019-11-25 08:55:06,464 INFO L796 eck$LassoCheckResult]: Loop: 343#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 344#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 343#L42-3 [2019-11-25 08:55:06,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:06,465 INFO L82 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 4 times [2019-11-25 08:55:06,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:06,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506972910] [2019-11-25 08:55:06,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:06,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506972910] [2019-11-25 08:55:06,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947341846] [2019-11-25 08:55:06,581 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:07,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-25 08:55:07,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:07,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:55:07,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:07,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:07,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-25 08:55:07,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648570970] [2019-11-25 08:55:07,065 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:07,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 5 times [2019-11-25 08:55:07,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:07,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733400745] [2019-11-25 08:55:07,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:07,071 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:07,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:55:07,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:07,103 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-11-25 08:55:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:07,151 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-11-25 08:55:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:55:07,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2019-11-25 08:55:07,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:07,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2019-11-25 08:55:07,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:07,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:07,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2019-11-25 08:55:07,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:07,153 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-25 08:55:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2019-11-25 08:55:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-25 08:55:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-25 08:55:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-25 08:55:07,155 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-25 08:55:07,155 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-25 08:55:07,155 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:55:07,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-25 08:55:07,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:07,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:07,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:07,157 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2019-11-25 08:55:07,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:07,157 INFO L794 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 418#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 419#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 425#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 426#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 427#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 428#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 434#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 433#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 432#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 431#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 430#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 429#L27-3 assume !(main_~j~0 < 10); 423#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 424#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 421#L42-3 [2019-11-25 08:55:07,157 INFO L796 eck$LassoCheckResult]: Loop: 421#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 422#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 421#L42-3 [2019-11-25 08:55:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904350, now seen corresponding path program 5 times [2019-11-25 08:55:07,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:07,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728291520] [2019-11-25 08:55:07,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:07,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728291520] [2019-11-25 08:55:07,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828032733] [2019-11-25 08:55:07,245 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:08,359 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-25 08:55:08,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:08,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:55:08,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:08,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:08,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-25 08:55:08,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943805080] [2019-11-25 08:55:08,381 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 6 times [2019-11-25 08:55:08,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:08,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635324973] [2019-11-25 08:55:08,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:08,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:08,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:08,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:55:08,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:55:08,421 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-11-25 08:55:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:08,474 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-11-25 08:55:08,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:08,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2019-11-25 08:55:08,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:08,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2019-11-25 08:55:08,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:08,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:08,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-11-25 08:55:08,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:08,478 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-25 08:55:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-11-25 08:55:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-25 08:55:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-25 08:55:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-25 08:55:08,480 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-25 08:55:08,480 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-25 08:55:08,480 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:55:08,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-11-25 08:55:08,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:08,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:08,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:08,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2019-11-25 08:55:08,481 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:08,482 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 509#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 510#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 516#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 517#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 518#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 519#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 527#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 526#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 525#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 524#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 523#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 522#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 521#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 520#L27-3 assume !(main_~j~0 < 10); 512#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 513#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 514#L42-3 [2019-11-25 08:55:08,482 INFO L796 eck$LassoCheckResult]: Loop: 514#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 515#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 514#L42-3 [2019-11-25 08:55:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295068, now seen corresponding path program 6 times [2019-11-25 08:55:08,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:08,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909980408] [2019-11-25 08:55:08,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:08,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909980408] [2019-11-25 08:55:08,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435979234] [2019-11-25 08:55:08,582 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:09,648 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-25 08:55:09,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:09,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:55:09,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:09,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:09,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-25 08:55:09,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181457292] [2019-11-25 08:55:09,663 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 7 times [2019-11-25 08:55:09,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:09,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624930628] [2019-11-25 08:55:09,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:09,670 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:09,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:09,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:55:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:09,717 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-11-25 08:55:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:09,771 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-25 08:55:09,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:55:09,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-11-25 08:55:09,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:09,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2019-11-25 08:55:09,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:09,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:09,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2019-11-25 08:55:09,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:09,774 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-25 08:55:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2019-11-25 08:55:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-25 08:55:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-25 08:55:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-25 08:55:09,776 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-25 08:55:09,776 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-25 08:55:09,776 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:55:09,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-11-25 08:55:09,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:09,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:09,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:09,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2019-11-25 08:55:09,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:09,777 INFO L794 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 611#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 612#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 618#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 619#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 620#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 621#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 631#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 630#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 629#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 628#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 627#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 626#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 625#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 624#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 623#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 622#L27-3 assume !(main_~j~0 < 10); 616#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 617#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 614#L42-3 [2019-11-25 08:55:09,778 INFO L796 eck$LassoCheckResult]: Loop: 614#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 615#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 614#L42-3 [2019-11-25 08:55:09,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash 72219098, now seen corresponding path program 7 times [2019-11-25 08:55:09,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:09,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013546808] [2019-11-25 08:55:09,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:09,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013546808] [2019-11-25 08:55:09,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140911944] [2019-11-25 08:55:09,860 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:09,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:55:09,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:09,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:09,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-25 08:55:09,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822432932] [2019-11-25 08:55:09,950 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:09,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 8 times [2019-11-25 08:55:09,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:09,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563545540] [2019-11-25 08:55:09,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:09,956 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:09,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:09,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:55:09,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:55:09,983 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-11-25 08:55:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:10,045 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-25 08:55:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:55:10,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2019-11-25 08:55:10,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:10,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2019-11-25 08:55:10,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:10,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:10,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2019-11-25 08:55:10,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:10,047 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-25 08:55:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2019-11-25 08:55:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-25 08:55:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-25 08:55:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-25 08:55:10,050 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-25 08:55:10,050 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-25 08:55:10,050 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:55:10,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-11-25 08:55:10,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:10,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:10,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:10,052 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2019-11-25 08:55:10,052 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:10,052 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 724#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 725#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 731#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 732#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 733#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 734#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 746#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 745#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 744#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 743#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 742#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 741#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 740#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 739#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 738#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 737#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 736#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 735#L27-3 assume !(main_~j~0 < 10); 727#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 728#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 729#L42-3 [2019-11-25 08:55:10,053 INFO L796 eck$LassoCheckResult]: Loop: 729#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 730#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 729#L42-3 [2019-11-25 08:55:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash 684732824, now seen corresponding path program 8 times [2019-11-25 08:55:10,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:10,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362734493] [2019-11-25 08:55:10,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:10,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362734493] [2019-11-25 08:55:10,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380653360] [2019-11-25 08:55:10,154 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:10,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:55:10,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:10,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:55:10,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:10,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:10,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-25 08:55:10,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764759713] [2019-11-25 08:55:10,244 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 9 times [2019-11-25 08:55:10,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:10,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184220663] [2019-11-25 08:55:10,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:10,248 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:10,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:10,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:55:10,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:55:10,281 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-11-25 08:55:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:10,356 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-11-25 08:55:10,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:55:10,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2019-11-25 08:55:10,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:10,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2019-11-25 08:55:10,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:10,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:10,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2019-11-25 08:55:10,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:10,359 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-25 08:55:10,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2019-11-25 08:55:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-25 08:55:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-25 08:55:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-25 08:55:10,361 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-25 08:55:10,361 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-25 08:55:10,362 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-25 08:55:10,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-11-25 08:55:10,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:10,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:10,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:10,363 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1] [2019-11-25 08:55:10,363 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:10,363 INFO L794 eck$LassoCheckResult]: Stem: 850#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 848#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 849#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 855#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 856#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 857#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 858#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 872#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 871#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 870#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 869#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 868#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 867#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 866#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 865#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 864#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 863#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 862#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 861#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 860#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 859#L27-3 assume !(main_~j~0 < 10); 851#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 852#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 853#L42-3 [2019-11-25 08:55:10,363 INFO L796 eck$LassoCheckResult]: Loop: 853#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 854#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 853#L42-3 [2019-11-25 08:55:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:10,364 INFO L82 PathProgramCache]: Analyzing trace with hash 899903958, now seen corresponding path program 9 times [2019-11-25 08:55:10,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:10,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249182388] [2019-11-25 08:55:10,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:10,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249182388] [2019-11-25 08:55:10,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280080749] [2019-11-25 08:55:10,524 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:12,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-25 08:55:12,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:12,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:55:12,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:12,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:12,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-25 08:55:12,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373125896] [2019-11-25 08:55:12,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:12,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 10 times [2019-11-25 08:55:12,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:12,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208470575] [2019-11-25 08:55:12,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:12,877 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:12,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:12,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:55:12,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:55:12,909 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-11-25 08:55:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:12,973 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-25 08:55:12,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:55:12,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2019-11-25 08:55:12,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:12,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2019-11-25 08:55:12,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-25 08:55:12,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:55:12,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2019-11-25 08:55:12,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:12,975 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-25 08:55:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2019-11-25 08:55:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-25 08:55:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-25 08:55:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-25 08:55:12,977 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-25 08:55:12,977 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-25 08:55:12,978 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-25 08:55:12,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-11-25 08:55:12,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:55:12,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:12,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:12,979 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2019-11-25 08:55:12,979 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:55:12,979 INFO L794 eck$LassoCheckResult]: Stem: 984#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 982#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, 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~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 983#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 989#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 990#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 991#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 992#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1008#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1007#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1006#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1005#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1004#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1003#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1002#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1001#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1000#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 999#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 998#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 997#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 996#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 995#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 994#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 993#L27-3 assume !(main_~j~0 < 10); 985#L27-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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 986#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem13; 987#L42-3 [2019-11-25 08:55:12,979 INFO L796 eck$LassoCheckResult]: Loop: 987#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 988#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 987#L42-3 [2019-11-25 08:55:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 10 times [2019-11-25 08:55:12,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:12,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289235267] [2019-11-25 08:55:12,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:14,062 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-11-25 08:55:14,221 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2019-11-25 08:55:14,429 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-25 08:55:14,907 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 73 [2019-11-25 08:55:15,270 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 77 [2019-11-25 08:55:15,781 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 81 [2019-11-25 08:55:16,219 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 86 [2019-11-25 08:55:16,763 WARN L192 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 77 [2019-11-25 08:55:17,274 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 73 [2019-11-25 08:55:17,673 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 73 [2019-11-25 08:55:18,222 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 74 [2019-11-25 08:55:18,753 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 77 [2019-11-25 08:55:19,240 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 75 [2019-11-25 08:55:19,667 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 79 [2019-11-25 08:55:20,027 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 59 [2019-11-25 08:55:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 56 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:20,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289235267] [2019-11-25 08:55:20,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024327883] [2019-11-25 08:55:20,083 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adb1956f-60d3-49c6-91da-0dca75a91726/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:23,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-25 08:55:23,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:23,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-25 08:55:23,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:23,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 08:55:23,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:23,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:23,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:23,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 08:55:23,928 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 28=[|v_#valid_81|]} [2019-11-25 08:55:23,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 [2019-11-25 08:55:23,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:23,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:23,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,028 INFO L343 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2019-11-25 08:55:24,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 54 [2019-11-25 08:55:24,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,082 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-11-25 08:55:24,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:66 [2019-11-25 08:55:24,197 INFO L377 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 [2019-11-25 08:55:24,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:24,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:77 [2019-11-25 08:55:24,368 INFO L377 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 [2019-11-25 08:55:24,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:24,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,416 INFO L377 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 [2019-11-25 08:55:24,416 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:24,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:86 [2019-11-25 08:55:24,589 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_32|], 6=[|v_#memory_$Pointer$.base_41|]} [2019-11-25 08:55:24,592 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:24,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:24,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,654 INFO L377 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 [2019-11-25 08:55:24,655 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:24,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:95 [2019-11-25 08:55:24,887 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_33|], 12=[|v_#memory_$Pointer$.base_42|]} [2019-11-25 08:55:24,889 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:24,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:24,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:24,943 INFO L377 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 [2019-11-25 08:55:24,943 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:24,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:24,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:104 [2019-11-25 08:55:25,202 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_34|], 20=[|v_#memory_$Pointer$.base_43|]} [2019-11-25 08:55:25,206 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:25,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:25,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,291 INFO L377 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 79 treesize of output 74 [2019-11-25 08:55:25,292 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:25,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:25,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:25,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:143, output treesize:116 [2019-11-25 08:55:25,565 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_35|], 30=[|v_#memory_$Pointer$.base_44|]} [2019-11-25 08:55:25,567 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:25,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:25,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:25,662 INFO L377 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 85 treesize of output 83 [2019-11-25 08:55:25,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:25,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:25,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:25,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:149, output treesize:122 [2019-11-25 08:55:25,958 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_36|], 42=[|v_#memory_$Pointer$.base_45|]} [2019-11-25 08:55:25,962 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:26,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:26,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,063 INFO L377 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 97 treesize of output 98 [2019-11-25 08:55:26,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:26,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:26,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:26,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:161, output treesize:134 [2019-11-25 08:55:26,373 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_37|], 56=[|v_#memory_$Pointer$.base_46|]} [2019-11-25 08:55:26,377 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:26,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:26,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:26,495 INFO L377 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 103 treesize of output 107 [2019-11-25 08:55:26,496 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:26,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:26,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:26,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:167, output treesize:140 [2019-11-25 08:55:26,879 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_38|], 72=[|v_#memory_$Pointer$.base_47|]} [2019-11-25 08:55:26,883 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:27,028 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-25 08:55:27,029 INFO L567 ElimStorePlain]: treesize reduction 3, result has 98.4 percent of original size [2019-11-25 08:55:27,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,073 INFO L377 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 115 treesize of output 122 [2019-11-25 08:55:27,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:27,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:27,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:55:27,128 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:182, output treesize:152 [2019-11-25 08:55:27,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,705 INFO L237 Elim1Store]: Index analysis took 187 ms [2019-11-25 08:55:27,742 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:27,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 171 [2019-11-25 08:55:27,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:28,586 WARN L192 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-11-25 08:55:28,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:28,589 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|, |v_#memory_$Pointer$.offset_30|], 2=[|v_#memory_int_40|, |v_#memory_int_41|, |#memory_int|], 6=[|v_#memory_$Pointer$.base_39|], 90=[|v_#memory_$Pointer$.base_48|]} [2019-11-25 08:55:28,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:28,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2019-11-25 08:55:28,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:29,357 WARN L192 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-11-25 08:55:29,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:29,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:29,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:29,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:55:29,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 29 [2019-11-25 08:55:29,402 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:29,809 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-25 08:55:29,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:29,818 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:30,297 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-25 08:55:30,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:30,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:30,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:30,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 25 [2019-11-25 08:55:30,320 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:30,603 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-25 08:55:30,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:30,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 10 [2019-11-25 08:55:30,616 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:30,895 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-25 08:55:30,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:30,899 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:31,195 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-25 08:55:31,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:31,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:31,391 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-25 08:55:31,391 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:31,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 432 [2019-11-25 08:55:31,393 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:31,646 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 108 [2019-11-25 08:55:31,647 INFO L567 ElimStorePlain]: treesize reduction 277, result has 45.9 percent of original size [2019-11-25 08:55:31,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:31,649 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:417, output treesize:324 [2019-11-25 08:55:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:31,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:31,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 40 [2019-11-25 08:55:31,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841934334] [2019-11-25 08:55:31,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 11 times [2019-11-25 08:55:31,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:31,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469279596] [2019-11-25 08:55:31,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:31,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:31,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:31,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-25 08:55:31,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2019-11-25 08:55:31,903 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 42 states. [2019-11-25 08:55:32,645 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 82 [2019-11-25 08:55:33,542 WARN L192 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-25 08:55:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:33,543 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-25 08:55:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-25 08:55:33,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 25 transitions. [2019-11-25 08:55:33,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:55:33,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-11-25 08:55:33,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-25 08:55:33,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-25 08:55:33,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-25 08:55:33,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:33,544 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:55:33,544 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:55:33,544 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:55:33,544 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-25 08:55:33,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:55:33,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:55:33,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-25 08:55:33,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:55:33 BoogieIcfgContainer [2019-11-25 08:55:33,553 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:55:33,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:55:33,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:55:33,554 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:55:33,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:02" (3/4) ... [2019-11-25 08:55:33,563 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:55:33,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:55:33,571 INFO L168 Benchmark]: Toolchain (without parser) took 31742.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 951.5 MB in the beginning and 1.2 GB in the end (delta: -291.7 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:33,571 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:33,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:33,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:33,575 INFO L168 Benchmark]: Boogie Preprocessor took 34.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:33,575 INFO L168 Benchmark]: RCFGBuilder took 561.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:33,576 INFO L168 Benchmark]: BuchiAutomizer took 30746.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:33,576 INFO L168 Benchmark]: Witness Printer took 15.98 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:33,577 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 561.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30746.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Witness Printer took 15.98 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 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 19 * unknown-#length-unknown[dummies] + -8 * j 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 30.7s and 13 iterations. TraceHistogramMax:10. Analysis of lassos took 28.2s. Construction of modules took 1.2s. Büchi inclusion checks took 1.1s. 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, 77 SDslu, 221 SDs, 0 SdLazy, 521 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital298 mio100 ax100 hnf100 lsp95 ukn38 mio100 lsp61 div100 bol100 ite100 ukn100 eq168 hnf65 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms 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...