./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test27-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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.25-f470102 [2019-12-07 12:11:52,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:11:52,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:11:52,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:11:52,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:11:52,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:11:52,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:11:52,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:11:52,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:11:52,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:11:52,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:11:52,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:11:52,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:11:52,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:11:52,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:11:52,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:11:52,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:11:52,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:11:52,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:11:52,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:11:52,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:11:52,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:11:52,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:11:52,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:11:52,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:11:52,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:11:52,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:11:52,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:11:52,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:11:52,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:11:52,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:11:52,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:11:52,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:11:52,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:11:52,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:11:52,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:11:52,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:11:52,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:11:52,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:11:52,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:11:52,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:11:52,694 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 12:11:52,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:11:52,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:11:52,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:11:52,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:11:52,710 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:11:52,710 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 12:11:52,710 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 12:11:52,710 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 12:11:52,711 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 12:11:52,711 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 12:11:52,711 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 12:11:52,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:11:52,711 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:11:52,712 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:11:52,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:11:52,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:11:52,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:11:52,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 12:11:52,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 12:11:52,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 12:11:52,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:11:52,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:11:52,713 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 12:11:52,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:11:52,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 12:11:52,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:11:52,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:11:52,714 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 12:11:52,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:11:52,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:11:52,715 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:11:52,715 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 12:11:52,715 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 12:11:52,716 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_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:52,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:11:52,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:11:52,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:11:52,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:11:52,829 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:11:52,829 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/test27-2.c [2019-12-07 12:11:52,875 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/data/a44402ac6/b7a18fba43a94732b1a4482d25c560bb/FLAGf1e423f5f [2019-12-07 12:11:53,201 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:11:53,202 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/sv-benchmarks/c/ldv-regression/test27-2.c [2019-12-07 12:11:53,206 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/data/a44402ac6/b7a18fba43a94732b1a4482d25c560bb/FLAGf1e423f5f [2019-12-07 12:11:53,640 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/data/a44402ac6/b7a18fba43a94732b1a4482d25c560bb [2019-12-07 12:11:53,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:11:53,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:11:53,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:11:53,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:11:53,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:11:53,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675abcba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53, skipping insertion in model container [2019-12-07 12:11:53,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:11:53,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:11:53,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:11:53,813 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:11:53,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:11:53,837 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:11:53,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53 WrapperNode [2019-12-07 12:11:53,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:11:53,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:11:53,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:11:53,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:11:53,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:11:53,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:11:53,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:11:53,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:11:53,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... [2019-12-07 12:11:53,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:11:53,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:11:53,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:11:53,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:11:53,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:11:53,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:11:54,111 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:11:54,111 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:11:54,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:11:54 BoogieIcfgContainer [2019-12-07 12:11:54,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:11:54,112 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 12:11:54,112 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 12:11:54,115 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 12:11:54,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 12:11:54,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 12:11:53" (1/3) ... [2019-12-07 12:11:54,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53a0f3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 12:11:54, skipping insertion in model container [2019-12-07 12:11:54,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 12:11:54,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:11:53" (2/3) ... [2019-12-07 12:11:54,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53a0f3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 12:11:54, skipping insertion in model container [2019-12-07 12:11:54,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 12:11:54,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:11:54" (3/3) ... [2019-12-07 12:11:54,117 INFO L371 chiAutomizerObserver]: Analyzing ICFG test27-2.c [2019-12-07 12:11:54,145 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 12:11:54,145 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 12:11:54,145 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 12:11:54,145 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:11:54,145 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:11:54,146 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 12:11:54,146 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:11:54,146 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 12:11:54,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-12-07 12:11:54,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-12-07 12:11:54,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:54,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:54,174 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 12:11:54,174 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:54,174 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 12:11:54,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-12-07 12:11:54,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-12-07 12:11:54,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:54,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:54,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 12:11:54,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:54,180 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-12-07 12:11:54,180 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-12-07 12:11:54,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 12:11:54,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:54,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050678114] [2019-12-07 12:11:54,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:54,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:54,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-12-07 12:11:54,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:54,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864038622] [2019-12-07 12:11:54,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:54,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:54,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:54,296 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-12-07 12:11:54,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:54,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557797823] [2019-12-07 12:11:54,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:54,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:54,439 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:11:54,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:11:54,501 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:11:54,570 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:11:54,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:11:54,572 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:178 [2019-12-07 12:11:54,758 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-12-07 12:11:54,815 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 12:11:54,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 12:11:54,816 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 12:11:54,816 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 12:11:54,816 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 12:11:54,816 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 12:11:54,816 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 12:11:54,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 12:11:54,816 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-2.c_Iteration1_Lasso [2019-12-07 12:11:54,816 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 12:11:54,817 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 12:11:54,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:54,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 12:11:55,180 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 12:11:55,184 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,188 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-12-07 12:11:55,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 12:11:55,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 12:11:55,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 12:11:55,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,198 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-12-07 12:11:55,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 12:11:55,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 12:11:55,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 12:11:55,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,206 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-12-07 12:11:55,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 12:11:55,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 12:11:55,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 12:11:55,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 12:11:55,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 12:11:55,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 12:11:55,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 12:11:55,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,220 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-12-07 12:11:55,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 12:11:55,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 12:11:55,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 12:11:55,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 12:11:55,228 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-12-07 12:11:55,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 12:11:55,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 12:11:55,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 12:11:55,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 12:11:55,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 12:11:55,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 12:11:55,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,249 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-12-07 12:11:55,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 12:11:55,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 12:11:55,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,264 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-12-07 12:11:55,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 12:11:55,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 12:11:55,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 12:11:55,275 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-12-07 12:11:55,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 12:11:55,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 12:11:55,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,285 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-12-07 12:11:55,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 12:11:55,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 12:11:55,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,296 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-12-07 12:11:55,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 12:11:55,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 12:11:55,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 12:11:55,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 12:11:55,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 12:11:55,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 12:11:55,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 12:11:55,319 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-12-07 12:11:55,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 12:11:55,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 12:11:55,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,329 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-12-07 12:11:55,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 12:11:55,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 12:11:55,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 12:11:55,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 12:11:55,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 12:11:55,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 12:11:55,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 12:11:55,402 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-12-07 12:11:55,402 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_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,407 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 12:11:55,410 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 12:11:55,410 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 12:11:55,411 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-12-07 12:11:55,452 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-12-07 12:11:55,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 12:11:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:55,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:11:55,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:55,497 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:11:55,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:55,518 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-12-07 12:11:55,519 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-12-07 12:11:55,586 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-12-07 12:11:55,587 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-12-07 12:11:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 12:11:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-12-07 12:11:55,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2019-12-07 12:11:55,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 12:11:55,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 12:11:55,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 12:11:55,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2019-12-07 12:11:55,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 12:11:55,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2019-12-07 12:11:55,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:55,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2019-12-07 12:11:55,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 12:11:55,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:55,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-12-07 12:11:55,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:55,597 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-12-07 12:11:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-12-07 12:11:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-12-07 12:11:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 12:11:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-12-07 12:11:55,614 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-12-07 12:11:55,614 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-12-07 12:11:55,614 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 12:11:55,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-12-07 12:11:55,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:55,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:55,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:55,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 12:11:55,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:55,615 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 144#L42-3 [2019-12-07 12:11:55,615 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-12-07 12:11:55,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2019-12-07 12:11:55,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:55,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962012804] [2019-12-07 12:11:55,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:55,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962012804] [2019-12-07 12:11:55,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:11:55,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:11:55,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811236848] [2019-12-07 12:11:55,660 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:11:55,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:55,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2019-12-07 12:11:55,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:55,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231030865] [2019-12-07 12:11:55,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:55,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:55,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:11:55,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:11:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:11:55,691 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-12-07 12:11:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:11:55,701 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-12-07 12:11:55,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:11:55,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-12-07 12:11:55,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:55,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-12-07 12:11:55,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:11:55,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:55,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-12-07 12:11:55,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:55,703 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-12-07 12:11:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-12-07 12:11:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-12-07 12:11:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 12:11:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-12-07 12:11:55,705 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-12-07 12:11:55,705 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-12-07 12:11:55,705 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 12:11:55,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-12-07 12:11:55,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:55,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:55,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:55,705 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:11:55,705 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:55,706 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 167#L42-3 [2019-12-07 12:11:55,706 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-12-07 12:11:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2019-12-07 12:11:55,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:55,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372705376] [2019-12-07 12:11:55,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:55,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372705376] [2019-12-07 12:11:55,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958196180] [2019-12-07 12:11:55,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:55,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:11:55,774 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:55,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:11:55,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 12:11:55,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484747567] [2019-12-07 12:11:55,781 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:11:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2019-12-07 12:11:55,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:55,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004930877] [2019-12-07 12:11:55,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:55,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:55,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:11:55,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:11:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:11:55,809 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-12-07 12:11:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:11:55,828 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-12-07 12:11:55,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:11:55,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-12-07 12:11:55,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:55,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-12-07 12:11:55,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:11:55,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:55,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-12-07 12:11:55,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:55,830 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-12-07 12:11:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-12-07 12:11:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-12-07 12:11:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 12:11:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-12-07 12:11:55,831 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-12-07 12:11:55,831 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-12-07 12:11:55,831 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 12:11:55,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-12-07 12:11:55,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:55,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:55,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:55,832 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-12-07 12:11:55,832 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:55,832 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 214#L42-3 [2019-12-07 12:11:55,832 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-12-07 12:11:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash -367607132, now seen corresponding path program 2 times [2019-12-07 12:11:55,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:55,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778151879] [2019-12-07 12:11:55,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:55,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778151879] [2019-12-07 12:11:55,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885125466] [2019-12-07 12:11:55,874 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:55,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:11:55,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:11:55,915 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:11:55,915 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:55,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:11:55,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-07 12:11:55,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280482540] [2019-12-07 12:11:55,921 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:11:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2019-12-07 12:11:55,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:55,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517510291] [2019-12-07 12:11:55,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:55,926 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:55,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:11:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:11:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:11:55,941 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-12-07 12:11:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:11:55,961 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-12-07 12:11:55,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:11:55,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2019-12-07 12:11:55,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:55,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2019-12-07 12:11:55,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:11:55,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:55,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2019-12-07 12:11:55,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:55,963 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-12-07 12:11:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2019-12-07 12:11:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-12-07 12:11:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 12:11:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-12-07 12:11:55,965 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-12-07 12:11:55,965 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-12-07 12:11:55,965 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 12:11:55,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-12-07 12:11:55,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:55,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:55,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:55,965 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2019-12-07 12:11:55,966 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:55,966 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 274#L42-3 [2019-12-07 12:11:55,966 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-12-07 12:11:55,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:55,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479198, now seen corresponding path program 3 times [2019-12-07 12:11:55,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:55,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503165312] [2019-12-07 12:11:55,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:56,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503165312] [2019-12-07 12:11:56,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994511038] [2019-12-07 12:11:56,003 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:56,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 12:11:56,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:11:56,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:11:56,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:56,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:11:56,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-07 12:11:56,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088285993] [2019-12-07 12:11:56,108 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:11:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2019-12-07 12:11:56,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:56,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555379532] [2019-12-07 12:11:56,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:56,114 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:56,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:11:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:11:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:11:56,129 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-12-07 12:11:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:11:56,148 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-12-07 12:11:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:11:56,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-12-07 12:11:56,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:56,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-12-07 12:11:56,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:11:56,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:56,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-12-07 12:11:56,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:56,150 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-12-07 12:11:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-12-07 12:11:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-12-07 12:11:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 12:11:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-12-07 12:11:56,151 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-12-07 12:11:56,151 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-12-07 12:11:56,151 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 12:11:56,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-12-07 12:11:56,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:56,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:56,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:56,152 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2019-12-07 12:11:56,152 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:56,152 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 343#L42-3 [2019-12-07 12:11:56,152 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-12-07 12:11:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 4 times [2019-12-07 12:11:56,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:56,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320795466] [2019-12-07 12:11:56,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:56,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320795466] [2019-12-07 12:11:56,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498901321] [2019-12-07 12:11:56,194 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:56,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:11:56,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:11:56,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:11:56,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:56,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:11:56,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-07 12:11:56,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879500829] [2019-12-07 12:11:56,599 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:11:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 5 times [2019-12-07 12:11:56,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:56,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523960658] [2019-12-07 12:11:56,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:56,603 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:56,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:11:56,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:11:56,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:11:56,618 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-12-07 12:11:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:11:56,645 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-12-07 12:11:56,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:11:56,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2019-12-07 12:11:56,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:56,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2019-12-07 12:11:56,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:11:56,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:56,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2019-12-07 12:11:56,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:56,647 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-12-07 12:11:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2019-12-07 12:11:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-12-07 12:11:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 12:11:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 12:11:56,649 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 12:11:56,649 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 12:11:56,649 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 12:11:56,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-12-07 12:11:56,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:56,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:56,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:56,650 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2019-12-07 12:11:56,650 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:56,650 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 421#L42-3 [2019-12-07 12:11:56,650 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-12-07 12:11:56,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:56,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904350, now seen corresponding path program 5 times [2019-12-07 12:11:56,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:56,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085007489] [2019-12-07 12:11:56,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:56,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085007489] [2019-12-07 12:11:56,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83270434] [2019-12-07 12:11:56,701 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:57,719 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 12:11:57,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:11:57,721 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:11:57,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:57,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:11:57,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-07 12:11:57,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890835919] [2019-12-07 12:11:57,730 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:11:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 6 times [2019-12-07 12:11:57,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:57,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443853370] [2019-12-07 12:11:57,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:57,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:57,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:11:57,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:11:57,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:11:57,754 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-12-07 12:11:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:11:57,784 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-12-07 12:11:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:11:57,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2019-12-07 12:11:57,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:57,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 12:11:57,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:11:57,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:57,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-12-07 12:11:57,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:57,786 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 12:11:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-12-07 12:11:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-12-07 12:11:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 12:11:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-12-07 12:11:57,787 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-12-07 12:11:57,787 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-12-07 12:11:57,787 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 12:11:57,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-12-07 12:11:57,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:57,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:57,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:57,789 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2019-12-07 12:11:57,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:57,789 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 514#L42-3 [2019-12-07 12:11:57,789 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-12-07 12:11:57,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:57,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295068, now seen corresponding path program 6 times [2019-12-07 12:11:57,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:57,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372832590] [2019-12-07 12:11:57,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:57,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372832590] [2019-12-07 12:11:57,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624600671] [2019-12-07 12:11:57,839 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:58,725 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-07 12:11:58,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:11:58,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:11:58,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:58,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:11:58,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-07 12:11:58,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261270278] [2019-12-07 12:11:58,736 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:11:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 7 times [2019-12-07 12:11:58,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:58,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250420191] [2019-12-07 12:11:58,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:58,740 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:58,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:11:58,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:11:58,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:11:58,756 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-12-07 12:11:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:11:58,798 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-12-07 12:11:58,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:11:58,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-12-07 12:11:58,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:58,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2019-12-07 12:11:58,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:11:58,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:58,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2019-12-07 12:11:58,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:58,800 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-12-07 12:11:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2019-12-07 12:11:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-12-07 12:11:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 12:11:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-12-07 12:11:58,802 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 12:11:58,802 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 12:11:58,802 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 12:11:58,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-12-07 12:11:58,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:58,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:58,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:58,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2019-12-07 12:11:58,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:58,803 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 614#L42-3 [2019-12-07 12:11:58,803 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-12-07 12:11:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash 72219098, now seen corresponding path program 7 times [2019-12-07 12:11:58,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:58,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562573687] [2019-12-07 12:11:58,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:58,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562573687] [2019-12-07 12:11:58,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627377389] [2019-12-07 12:11:58,864 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:58,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 12:11:58,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:58,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:11:58,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-07 12:11:58,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77327046] [2019-12-07 12:11:58,916 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:11:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 8 times [2019-12-07 12:11:58,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:58,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630727208] [2019-12-07 12:11:58,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:58,920 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:58,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:11:58,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:11:58,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:11:58,935 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-12-07 12:11:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:11:58,970 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-12-07 12:11:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:11:58,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2019-12-07 12:11:58,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:58,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2019-12-07 12:11:58,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:11:58,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:58,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2019-12-07 12:11:58,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:58,972 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-12-07 12:11:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2019-12-07 12:11:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-12-07 12:11:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 12:11:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 12:11:58,973 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 12:11:58,973 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 12:11:58,974 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 12:11:58,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-12-07 12:11:58,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:58,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:58,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:58,974 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2019-12-07 12:11:58,974 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:58,975 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 729#L42-3 [2019-12-07 12:11:58,975 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-12-07 12:11:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash 684732824, now seen corresponding path program 8 times [2019-12-07 12:11:58,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:58,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445002167] [2019-12-07 12:11:58,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:59,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445002167] [2019-12-07 12:11:59,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472087009] [2019-12-07 12:11:59,032 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:11:59,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:11:59,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:11:59,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:11:59,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:11:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:59,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:11:59,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-07 12:11:59,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574326993] [2019-12-07 12:11:59,098 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:11:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 9 times [2019-12-07 12:11:59,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:59,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328038192] [2019-12-07 12:11:59,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:11:59,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:11:59,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:11:59,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:11:59,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:11:59,117 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-12-07 12:11:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:11:59,151 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-12-07 12:11:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:11:59,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2019-12-07 12:11:59,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:59,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2019-12-07 12:11:59,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:11:59,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:11:59,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2019-12-07 12:11:59,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:11:59,153 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-12-07 12:11:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2019-12-07 12:11:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-12-07 12:11:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 12:11:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-12-07 12:11:59,154 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-12-07 12:11:59,154 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-12-07 12:11:59,154 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 12:11:59,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-12-07 12:11:59,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:11:59,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:11:59,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:11:59,155 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1] [2019-12-07 12:11:59,156 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:11:59,156 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 853#L42-3 [2019-12-07 12:11:59,156 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-12-07 12:11:59,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:11:59,156 INFO L82 PathProgramCache]: Analyzing trace with hash 899903958, now seen corresponding path program 9 times [2019-12-07 12:11:59,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:11:59,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504691903] [2019-12-07 12:11:59,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:11:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:11:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:11:59,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504691903] [2019-12-07 12:11:59,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819212344] [2019-12-07 12:11:59,223 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:12:01,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-07 12:12:01,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:12:01,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:12:01,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:12:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:01,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:12:01,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-07 12:12:01,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786805571] [2019-12-07 12:12:01,163 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:12:01,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:01,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 10 times [2019-12-07 12:12:01,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:12:01,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411370825] [2019-12-07 12:12:01,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:12:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:12:01,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:12:01,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:12:01,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:12:01,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:12:01,183 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-12-07 12:12:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:01,227 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 12:12:01,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:12:01,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2019-12-07 12:12:01,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:12:01,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2019-12-07 12:12:01,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 12:12:01,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 12:12:01,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2019-12-07 12:12:01,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:12:01,229 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-12-07 12:12:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2019-12-07 12:12:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 12:12:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:12:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-12-07 12:12:01,230 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-12-07 12:12:01,230 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-12-07 12:12:01,230 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 12:12:01,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-12-07 12:12:01,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 12:12:01,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 12:12:01,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 12:12:01,231 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2019-12-07 12:12:01,231 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 12:12:01,232 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 987#L42-3 [2019-12-07 12:12:01,232 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-12-07 12:12:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 10 times [2019-12-07 12:12:01,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:12:01,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515296051] [2019-12-07 12:12:01,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:02,026 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-12-07 12:12:02,351 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 73 [2019-12-07 12:12:02,680 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 77 [2019-12-07 12:12:03,100 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 81 [2019-12-07 12:12:03,530 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 86 [2019-12-07 12:12:04,222 WARN L192 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 77 [2019-12-07 12:12:04,878 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 73 [2019-12-07 12:12:05,405 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 73 [2019-12-07 12:12:05,997 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 74 [2019-12-07 12:12:06,463 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 77 [2019-12-07 12:12:06,922 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 75 [2019-12-07 12:12:07,300 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 79 [2019-12-07 12:12:07,543 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 59 [2019-12-07 12:12:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 56 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:07,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515296051] [2019-12-07 12:12:07,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226689895] [2019-12-07 12:12:07,604 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c14a8cc4-97b3-4ec2-987a-2f473c1c933e/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-12-07 12:12:10,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:12:10,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:12:10,874 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 72 conjunts are in the unsatisfiable core [2019-12-07 12:12:10,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:12:10,888 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-12-07 12:12:10,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:10,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:10,890 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:10,890 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:12:10,893 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_56|], 28=[|v_#valid_81|]} [2019-12-07 12:12:10,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,904 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-12-07 12:12:10,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:10,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:10,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:10,964 INFO L343 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2019-12-07 12:12:10,964 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-12-07 12:12:10,965 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,005 INFO L614 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-12-07 12:12:11,005 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,005 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:66 [2019-12-07 12:12:11,107 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-12-07 12:12:11,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:11,129 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,129 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:77 [2019-12-07 12:12:11,252 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-12-07 12:12:11,252 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,278 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:11,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,282 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-12-07 12:12:11,282 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:11,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,306 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:86 [2019-12-07 12:12:11,443 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_32|], 6=[|v_#memory_$Pointer$.base_41|]} [2019-12-07 12:12:11,445 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:12:11,476 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:11,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,482 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-12-07 12:12:11,483 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:11,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,514 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:95 [2019-12-07 12:12:11,660 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_33|], 12=[|v_#memory_$Pointer$.base_42|]} [2019-12-07 12:12:11,662 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:12:11,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:11,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,706 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-12-07 12:12:11,706 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:11,736 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,736 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:104 [2019-12-07 12:12:11,895 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_34|], 20=[|v_#memory_$Pointer$.base_43|]} [2019-12-07 12:12:11,897 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:12:11,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:11,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:11,944 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-12-07 12:12:11,945 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:11,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:11,979 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:143, output treesize:116 [2019-12-07 12:12:12,185 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_35|], 30=[|v_#memory_$Pointer$.base_44|]} [2019-12-07 12:12:12,187 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:12:12,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:12,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,247 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-12-07 12:12:12,247 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:12,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:12,283 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:12,284 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:149, output treesize:122 [2019-12-07 12:12:12,635 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_36|], 42=[|v_#memory_$Pointer$.base_45|]} [2019-12-07 12:12:12,639 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:12:12,759 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 12:12:12,759 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:12,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:12,794 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-12-07 12:12:12,794 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:12,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:12,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:12,832 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:161, output treesize:134 [2019-12-07 12:12:13,062 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_37|], 56=[|v_#memory_$Pointer$.base_46|]} [2019-12-07 12:12:13,064 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:12:13,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:13,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,137 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-12-07 12:12:13,137 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:13,174 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:13,174 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:13,174 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:167, output treesize:140 [2019-12-07 12:12:13,420 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_38|], 72=[|v_#memory_$Pointer$.base_47|]} [2019-12-07 12:12:13,422 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:12:13,539 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 12:12:13,539 INFO L614 ElimStorePlain]: treesize reduction 3, result has 98.4 percent of original size [2019-12-07 12:12:13,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:13,572 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-12-07 12:12:13,573 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:13,618 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:13,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:13,619 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:182, output treesize:152 [2019-12-07 12:12:14,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:14,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:14,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:14,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:14,179 INFO L237 Elim1Store]: Index analysis took 185 ms [2019-12-07 12:12:14,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:14,211 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-12-07 12:12:14,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:14,950 WARN L192 SmtUtils]: Spent 738.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-12-07 12:12:14,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:14,952 INFO L430 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-12-07 12:12:14,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:15,012 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-12-07 12:12:15,012 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:15,684 WARN L192 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-12-07 12:12:15,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:15,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:15,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:15,709 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:12:15,731 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-12-07 12:12:15,731 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:16,137 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-12-07 12:12:16,138 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:16,146 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:12:16,611 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-12-07 12:12:16,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:16,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:16,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:16,635 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-12-07 12:12:16,635 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:16,910 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-07 12:12:16,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:16,921 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-12-07 12:12:16,922 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:17,187 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-12-07 12:12:17,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:17,190 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:12:17,492 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-12-07 12:12:17,492 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:17,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:17,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:17,646 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-12-07 12:12:17,648 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:17,835 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 108 [2019-12-07 12:12:17,836 INFO L614 ElimStorePlain]: treesize reduction 277, result has 45.9 percent of original size [2019-12-07 12:12:17,837 INFO L534 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-12-07 12:12:17,837 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:417, output treesize:324 [2019-12-07 12:12:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:18,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:12:18,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 40 [2019-12-07 12:12:18,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118140793] [2019-12-07 12:12:18,006 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 12:12:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:18,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 11 times [2019-12-07 12:12:18,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:12:18,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005630040] [2019-12-07 12:12:18,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:12:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:12:18,010 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:12:18,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:12:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 12:12:18,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 12:12:18,027 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 42 states. [2019-12-07 12:12:18,717 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 82 [2019-12-07 12:12:19,466 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-12-07 12:12:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:19,467 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-12-07 12:12:19,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 12:12:19,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 25 transitions. [2019-12-07 12:12:19,467 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 12:12:19,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-12-07 12:12:19,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 12:12:19,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 12:12:19,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 12:12:19,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 12:12:19,467 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:12:19,467 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:12:19,468 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:12:19,468 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 12:12:19,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:12:19,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 12:12:19,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 12:12:19,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 12:12:19 BoogieIcfgContainer [2019-12-07 12:12:19,472 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 12:12:19,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:12:19,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:12:19,472 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:12:19,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:11:54" (3/4) ... [2019-12-07 12:12:19,475 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:12:19,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:12:19,476 INFO L168 Benchmark]: Toolchain (without parser) took 25833.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 946.2 MB in the beginning and 864.9 MB in the end (delta: 81.3 MB). Peak memory consumption was 350.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:12:19,476 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:12:19,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:12:19,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:12:19,476 INFO L168 Benchmark]: Boogie Preprocessor took 19.31 ms. Allocated memory is still 1.1 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-12-07 12:12:19,476 INFO L168 Benchmark]: RCFGBuilder took 227.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:12:19,477 INFO L168 Benchmark]: BuchiAutomizer took 25359.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 864.9 MB in the end (delta: 200.3 MB). Peak memory consumption was 370.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:12:19,477 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.3 GB. Free memory is still 864.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:12:19,478 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.31 ms. Allocated memory is still 1.1 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. * RCFGBuilder took 227.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25359.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 864.9 MB in the end (delta: 200.3 MB). Peak memory consumption was 370.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.3 GB. Free memory is still 864.9 MB. 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 25.3s and 13 iterations. TraceHistogramMax:10. Analysis of lassos took 23.3s. Construction of modules took 1.0s. Büchi inclusion checks took 0.8s. 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.0s 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: 12ms 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...