./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:22:51,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:22:51,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:22:51,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:22:51,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:22:51,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:22:51,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:22:51,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:22:51,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:22:51,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:22:51,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:22:51,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:22:51,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:22:51,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:22:51,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:22:51,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:22:51,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:22:51,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:22:51,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:22:51,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:22:51,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:22:51,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:22:51,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:22:51,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:22:51,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:22:51,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:22:51,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:22:51,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:22:51,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:22:51,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:22:51,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:22:51,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:22:51,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:22:51,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:22:51,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:22:51,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:22:51,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:22:51,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:22:51,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:22:51,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:22:51,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:22:51,629 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-30 01:22:51,660 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:22:51,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:22:51,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:22:51,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:22:51,663 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:22:51,664 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 01:22:51,664 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 01:22:51,665 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 01:22:51,665 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 01:22:51,665 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 01:22:51,666 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 01:22:51,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:22:51,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:22:51,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:22:51,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:22:51,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 01:22:51,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 01:22:51,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 01:22:51,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:22:51,669 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 01:22:51,669 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:22:51,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 01:22:51,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:22:51,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:22:51,671 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 01:22:51,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:22:51,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:22:51,672 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:22:51,672 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 01:22:51,673 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 01:22:51,673 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2020-11-30 01:22:52,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:22:52,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:22:52,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:22:52,072 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:22:52,073 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:22:52,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-11-30 01:22:52,179 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/data/913f2ac20/b846b4fae9054052b8ea47e7bcfd61f5/FLAG12467407a [2020-11-30 01:22:52,719 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:22:52,720 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-11-30 01:22:52,729 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/data/913f2ac20/b846b4fae9054052b8ea47e7bcfd61f5/FLAG12467407a [2020-11-30 01:22:53,087 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/data/913f2ac20/b846b4fae9054052b8ea47e7bcfd61f5 [2020-11-30 01:22:53,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:22:53,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:22:53,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:22:53,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:22:53,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:22:53,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff614bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53, skipping insertion in model container [2020-11-30 01:22:53,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:22:53,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:22:53,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:22:53,408 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:22:53,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:22:53,480 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:22:53,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53 WrapperNode [2020-11-30 01:22:53,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:22:53,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:22:53,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:22:53,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:22:53,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:22:53,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:22:53,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:22:53,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:22:53,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... [2020-11-30 01:22:53,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:22:53,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:22:53,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:22:53,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:22:53,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:22:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:22:53,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:22:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 01:22:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:22:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:22:53,980 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:22:53,981 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 01:22:53,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:22:53 BoogieIcfgContainer [2020-11-30 01:22:53,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:22:53,999 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 01:22:54,000 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 01:22:54,016 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 01:22:54,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:22:54,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 01:22:53" (1/3) ... [2020-11-30 01:22:54,019 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cd07027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:22:54, skipping insertion in model container [2020-11-30 01:22:54,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:22:54,019 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:53" (2/3) ... [2020-11-30 01:22:54,020 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cd07027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:22:54, skipping insertion in model container [2020-11-30 01:22:54,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:22:54,020 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:22:53" (3/3) ... [2020-11-30 01:22:54,022 INFO L373 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2020-11-30 01:22:54,101 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 01:22:54,101 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 01:22:54,101 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 01:22:54,101 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:22:54,102 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:22:54,102 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 01:22:54,102 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:22:54,102 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 01:22:54,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-30 01:22:54,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-30 01:22:54,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:54,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:54,171 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 01:22:54,186 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 01:22:54,187 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 01:22:54,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-30 01:22:54,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-30 01:22:54,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:54,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:54,190 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 01:22:54,191 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 01:22:54,200 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2020-11-30 01:22:54,200 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 7#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2020-11-30 01:22:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:54,210 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-30 01:22:54,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:54,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313709541] [2020-11-30 01:22:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:54,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:54,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:54,392 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:54,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-30 01:22:54,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:54,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851995234] [2020-11-30 01:22:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:54,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:54,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:54,473 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:54,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-30 01:22:54,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:54,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247584854] [2020-11-30 01:22:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:54,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:54,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:54,586 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:54,852 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-11-30 01:22:54,924 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:22:54,925 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:22:54,926 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:22:54,926 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:22:54,926 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 01:22:54,926 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:54,927 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:22:54,927 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:22:54,927 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2020-11-30 01:22:54,927 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:22:54,928 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:22: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 [2020-11-30 01:22: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 [2020-11-30 01:22: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 [2020-11-30 01:22: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 [2020-11-30 01:22:55,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:22:55,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:22:55,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:22:55,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:22:55,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:22:55,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:22:55,383 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 01:22:55,389 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 01:22:55,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:55,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:22:55,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:22:55,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 01:22:55,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:55,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:22:55,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:22:55,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/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) [2020-11-30 01:22:55,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:55,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:22:55,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:22:55,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/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) [2020-11-30 01:22:55,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:55,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:22:55,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:22:55,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:55,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:22:55,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:22:55,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/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) [2020-11-30 01:22:55,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:55,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:22:55,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:22:55,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/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) [2020-11-30 01:22:55,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:55,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:22:55,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/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) [2020-11-30 01:22:55,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:22:55,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:22:55,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 01:22:55,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:55,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:22:55,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:55,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:55,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:55,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:22:55,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:55,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:55,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:55,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:22:55,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:22:55,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:56,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:56,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:56,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:22:56,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:56,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:56,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:56,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:22:56,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:22:56,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:56,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:22:56,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:22:56,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:22:56,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:22:56,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:22:56,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:22:56,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:22:56,102 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 01:22:56,168 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-11-30 01:22:56,169 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 01:22:56,192 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:22:56,195 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 01:22:56,195 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 01:22:56,196 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2020-11-30 01:22:56,243 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-11-30 01:22:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:56,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:22:56,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:56,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:22:56,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:56,384 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 01:22:56,387 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2020-11-30 01:22:56,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2020-11-30 01:22:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 01:22:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 01:22:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-11-30 01:22:56,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-30 01:22:56,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:22:56,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-30 01:22:56,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:22:56,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-30 01:22:56,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:22:56,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2020-11-30 01:22:56,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:56,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2020-11-30 01:22:56,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:22:56,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-30 01:22:56,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-11-30 01:22:56,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:22:56,468 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-11-30 01:22:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-11-30 01:22:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-11-30 01:22:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 01:22:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-11-30 01:22:56,494 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-11-30 01:22:56,495 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-11-30 01:22:56,495 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 01:22:56,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-11-30 01:22:56,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:56,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:56,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:56,496 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 01:22:56,496 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:22:56,497 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2020-11-30 01:22:56,497 INFO L796 eck$LassoCheckResult]: Loop: 83#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 89#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 82#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 83#L17-4 [2020-11-30 01:22:56,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2020-11-30 01:22:56,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:56,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843277165] [2020-11-30 01:22:56,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:56,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843277165] [2020-11-30 01:22:56,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:22:56,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:22:56,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006503366] [2020-11-30 01:22:56,552 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:22:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-11-30 01:22:56,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:56,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882297752] [2020-11-30 01:22:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:56,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:56,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:56,577 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:56,733 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:22:56,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:56,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:22:56,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:22:56,790 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-30 01:22:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:56,810 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-11-30 01:22:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:22:56,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-11-30 01:22:56,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:56,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2020-11-30 01:22:56,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:22:56,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:22:56,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-11-30 01:22:56,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:22:56,814 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-11-30 01:22:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-11-30 01:22:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-11-30 01:22:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 01:22:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-11-30 01:22:56,816 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-11-30 01:22:56,816 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-11-30 01:22:56,816 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 01:22:56,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-11-30 01:22:56,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:56,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:56,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:56,817 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-30 01:22:56,817 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:22:56,817 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2020-11-30 01:22:56,817 INFO L796 eck$LassoCheckResult]: Loop: 108#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 112#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 107#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 108#L17-4 [2020-11-30 01:22:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2020-11-30 01:22:56,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:56,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335122701] [2020-11-30 01:22:56,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:56,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335122701] [2020-11-30 01:22:56,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755117653] [2020-11-30 01:22:56,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:22:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:56,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:22:56,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:56,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:22:56,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-11-30 01:22:56,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802564902] [2020-11-30 01:22:56,971 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:22:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-11-30 01:22:56,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:56,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657436790] [2020-11-30 01:22:56,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:57,000 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:57,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:57,024 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:57,214 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:22:57,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:22:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:22:57,258 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-11-30 01:22:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:57,288 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-11-30 01:22:57,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:22:57,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-11-30 01:22:57,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:57,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-11-30 01:22:57,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:22:57,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:22:57,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-11-30 01:22:57,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:22:57,292 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-11-30 01:22:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-11-30 01:22:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-11-30 01:22:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-30 01:22:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-11-30 01:22:57,294 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-11-30 01:22:57,294 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-11-30 01:22:57,294 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 01:22:57,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-11-30 01:22:57,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:57,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:57,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:57,299 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-11-30 01:22:57,300 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:22:57,300 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2020-11-30 01:22:57,301 INFO L796 eck$LassoCheckResult]: Loop: 147#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 152#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 146#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 147#L17-4 [2020-11-30 01:22:57,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:57,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2020-11-30 01:22:57,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:57,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883142930] [2020-11-30 01:22:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:57,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883142930] [2020-11-30 01:22:57,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521955867] [2020-11-30 01:22:57,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:22:57,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:22:57,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:22:57,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:22:57,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:57,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:22:57,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-30 01:22:57,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185223592] [2020-11-30 01:22:57,505 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:22:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-11-30 01:22:57,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:57,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52811329] [2020-11-30 01:22:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:57,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:57,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:57,550 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:57,673 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:22:57,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:22:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:22:57,717 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-11-30 01:22:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:57,759 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-11-30 01:22:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:22:57,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-11-30 01:22:57,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:57,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2020-11-30 01:22:57,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:22:57,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:22:57,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-11-30 01:22:57,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:22:57,764 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-11-30 01:22:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-11-30 01:22:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-11-30 01:22:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-11-30 01:22:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-11-30 01:22:57,766 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-11-30 01:22:57,766 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-11-30 01:22:57,766 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 01:22:57,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-11-30 01:22:57,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:57,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:57,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:57,774 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2020-11-30 01:22:57,775 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:22:57,775 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2020-11-30 01:22:57,775 INFO L796 eck$LassoCheckResult]: Loop: 195#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 202#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 194#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 195#L17-4 [2020-11-30 01:22:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2020-11-30 01:22:57,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:57,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906394597] [2020-11-30 01:22:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:57,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906394597] [2020-11-30 01:22:57,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106561908] [2020-11-30 01:22:57,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:22:57,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-30 01:22:57,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:22:57,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:22:57,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:57,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:22:57,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-30 01:22:57,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091871389] [2020-11-30 01:22:57,993 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:22:57,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:57,994 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-11-30 01:22:57,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:57,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11644435] [2020-11-30 01:22:57,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:58,015 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:58,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:58,023 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:58,151 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:22:58,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:58,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:22:58,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:22:58,220 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-11-30 01:22:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:58,277 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-11-30 01:22:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:22:58,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-11-30 01:22:58,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:58,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2020-11-30 01:22:58,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:22:58,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:22:58,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2020-11-30 01:22:58,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:22:58,283 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-11-30 01:22:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2020-11-30 01:22:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-11-30 01:22:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-30 01:22:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-11-30 01:22:58,285 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-30 01:22:58,285 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-30 01:22:58,285 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 01:22:58,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-11-30 01:22:58,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:58,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:58,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:58,292 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2020-11-30 01:22:58,293 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:22:58,293 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2020-11-30 01:22:58,293 INFO L796 eck$LassoCheckResult]: Loop: 258#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 264#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 257#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 258#L17-4 [2020-11-30 01:22:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2020-11-30 01:22:58,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:58,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410096889] [2020-11-30 01:22:58,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:58,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410096889] [2020-11-30 01:22:58,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720485559] [2020-11-30 01:22:58,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/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 [2020-11-30 01:22:58,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:22:58,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:22:58,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:22:58,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:58,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:22:58,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-30 01:22:58,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229408683] [2020-11-30 01:22:58,501 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:22:58,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:58,501 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2020-11-30 01:22:58,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:58,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82357559] [2020-11-30 01:22:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:58,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:58,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:58,532 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:58,678 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:22:58,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:22:58,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:22:58,733 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-11-30 01:22:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:58,782 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-11-30 01:22:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:22:58,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-11-30 01:22:58,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:58,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-11-30 01:22:58,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:22:58,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:22:58,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-11-30 01:22:58,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:22:58,787 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-11-30 01:22:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-11-30 01:22:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-30 01:22:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-30 01:22:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-11-30 01:22:58,790 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-30 01:22:58,790 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-30 01:22:58,790 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 01:22:58,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-11-30 01:22:58,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:58,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:58,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:58,796 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2020-11-30 01:22:58,796 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:22:58,797 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2020-11-30 01:22:58,797 INFO L796 eck$LassoCheckResult]: Loop: 328#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 327#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 328#L17-4 [2020-11-30 01:22:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2020-11-30 01:22:58,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:58,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408485122] [2020-11-30 01:22:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:58,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408485122] [2020-11-30 01:22:58,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042150723] [2020-11-30 01:22:58,913 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/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 [2020-11-30 01:22:58,981 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-30 01:22:58,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:22:58,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:22:58,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:59,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:22:59,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-30 01:22:59,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823570366] [2020-11-30 01:22:59,042 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:22:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:59,043 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2020-11-30 01:22:59,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:59,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787593933] [2020-11-30 01:22:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:59,058 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:59,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:59,076 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:59,231 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:22:59,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:59,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:22:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:22:59,284 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-11-30 01:22:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:59,345 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-11-30 01:22:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:22:59,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-11-30 01:22:59,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:59,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2020-11-30 01:22:59,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:22:59,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:22:59,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-11-30 01:22:59,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:22:59,351 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-11-30 01:22:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-11-30 01:22:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-11-30 01:22:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-30 01:22:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-11-30 01:22:59,354 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-30 01:22:59,354 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-30 01:22:59,354 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 01:22:59,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-11-30 01:22:59,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:59,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:59,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:59,364 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2020-11-30 01:22:59,364 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:22:59,364 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2020-11-30 01:22:59,364 INFO L796 eck$LassoCheckResult]: Loop: 413#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 419#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 412#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 413#L17-4 [2020-11-30 01:22:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2020-11-30 01:22:59,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:59,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357794278] [2020-11-30 01:22:59,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:59,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357794278] [2020-11-30 01:22:59,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451175134] [2020-11-30 01:22:59,503 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:22:59,560 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-11-30 01:22:59,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:22:59,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:22:59,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:59,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:22:59,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-11-30 01:22:59,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128104121] [2020-11-30 01:22:59,633 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:22:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2020-11-30 01:22:59,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:59,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564958060] [2020-11-30 01:22:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:59,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:22:59,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:22:59,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:22:59,836 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:22:59,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:22:59,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:22:59,897 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2020-11-30 01:22:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:59,943 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-11-30 01:22:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:22:59,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-11-30 01:22:59,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:59,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2020-11-30 01:22:59,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:22:59,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:22:59,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-11-30 01:22:59,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:22:59,946 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-30 01:22:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-11-30 01:22:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-11-30 01:22:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-30 01:22:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-11-30 01:22:59,949 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-11-30 01:22:59,949 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-11-30 01:22:59,949 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 01:22:59,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-11-30 01:22:59,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:22:59,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:22:59,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:22:59,951 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2020-11-30 01:22:59,951 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:22:59,951 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2020-11-30 01:22:59,951 INFO L796 eck$LassoCheckResult]: Loop: 507#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 513#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 506#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 507#L17-4 [2020-11-30 01:22:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2020-11-30 01:22:59,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:59,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272778396] [2020-11-30 01:22:59,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:23:00,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272778396] [2020-11-30 01:23:00,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803279727] [2020-11-30 01:23:00,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/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 [2020-11-30 01:23:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:00,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:23:00,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:23:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:23:00,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:23:00,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-30 01:23:00,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355175400] [2020-11-30 01:23:00,237 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:23:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2020-11-30 01:23:00,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:00,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429265566] [2020-11-30 01:23:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:00,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:00,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:00,260 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:23:00,396 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:23:00,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:23:00,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:23:00,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:23:00,440 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-11-30 01:23:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:23:00,509 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-11-30 01:23:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:23:00,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-11-30 01:23:00,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:23:00,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2020-11-30 01:23:00,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:23:00,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:23:00,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-11-30 01:23:00,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:23:00,512 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-11-30 01:23:00,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-11-30 01:23:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-30 01:23:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-30 01:23:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-11-30 01:23:00,515 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-30 01:23:00,515 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-30 01:23:00,515 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-30 01:23:00,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-11-30 01:23:00,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:23:00,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:23:00,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:23:00,517 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2020-11-30 01:23:00,517 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:23:00,517 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2020-11-30 01:23:00,517 INFO L796 eck$LassoCheckResult]: Loop: 610#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 618#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 609#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 610#L17-4 [2020-11-30 01:23:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2020-11-30 01:23:00,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:00,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755079159] [2020-11-30 01:23:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:23:00,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755079159] [2020-11-30 01:23:00,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446525805] [2020-11-30 01:23:00,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:23:00,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:23:00,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:23:00,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 01:23:00,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:23:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:23:00,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:23:00,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-30 01:23:00,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417378633] [2020-11-30 01:23:00,799 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:23:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2020-11-30 01:23:00,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:00,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805698885] [2020-11-30 01:23:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:00,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:00,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:00,817 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:23:00,949 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:23:00,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:23:00,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:23:00,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:23:00,985 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-11-30 01:23:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:23:01,065 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-11-30 01:23:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:23:01,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-11-30 01:23:01,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:23:01,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-11-30 01:23:01,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:23:01,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:23:01,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-11-30 01:23:01,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:23:01,068 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-11-30 01:23:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-11-30 01:23:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-11-30 01:23:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-30 01:23:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-11-30 01:23:01,071 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-30 01:23:01,071 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-30 01:23:01,071 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-30 01:23:01,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-11-30 01:23:01,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:23:01,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:23:01,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:23:01,073 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2020-11-30 01:23:01,073 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:23:01,074 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2020-11-30 01:23:01,074 INFO L796 eck$LassoCheckResult]: Loop: 726#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 734#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 725#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 726#L17-4 [2020-11-30 01:23:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2020-11-30 01:23:01,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:01,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59216566] [2020-11-30 01:23:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:23:01,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59216566] [2020-11-30 01:23:01,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768098563] [2020-11-30 01:23:01,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:23:01,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-11-30 01:23:01,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:23:01,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 01:23:01,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:23:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:23:01,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:23:01,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-30 01:23:01,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309302778] [2020-11-30 01:23:01,417 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:23:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2020-11-30 01:23:01,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:01,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451662448] [2020-11-30 01:23:01,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:01,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:01,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:01,431 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:23:01,550 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:23:01,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:23:01,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:23:01,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:23:01,614 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-11-30 01:23:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:23:01,708 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-11-30 01:23:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:23:01,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-11-30 01:23:01,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:23:01,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2020-11-30 01:23:01,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 01:23:01,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 01:23:01,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2020-11-30 01:23:01,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:23:01,712 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-30 01:23:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2020-11-30 01:23:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-11-30 01:23:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-30 01:23:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-11-30 01:23:01,721 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-30 01:23:01,721 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-30 01:23:01,721 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-30 01:23:01,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-11-30 01:23:01,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:23:01,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:23:01,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:23:01,728 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2020-11-30 01:23:01,728 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:23:01,729 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2020-11-30 01:23:01,731 INFO L796 eck$LassoCheckResult]: Loop: 852#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 860#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 851#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 852#L17-4 [2020-11-30 01:23:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2020-11-30 01:23:01,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:01,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660097159] [2020-11-30 01:23:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:01,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:01,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:01,800 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:23:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:01,803 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2020-11-30 01:23:01,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:01,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339748014] [2020-11-30 01:23:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:01,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:01,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:01,828 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:23:01,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:01,829 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2020-11-30 01:23:01,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:01,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442002064] [2020-11-30 01:23:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:01,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:01,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:01,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:23:02,099 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-30 01:23:07,047 WARN L193 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 212 DAG size of output: 146 [2020-11-30 01:23:07,249 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-11-30 01:23:07,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 01:23:07 BoogieIcfgContainer [2020-11-30 01:23:07,297 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 01:23:07,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:23:07,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:23:07,298 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:23:07,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:22:53" (3/4) ... [2020-11-30 01:23:07,302 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-30 01:23:07,367 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ac97dfdc-cc3b-450b-ac88-dc8010f7e08c/bin/uautomizer/witness.graphml [2020-11-30 01:23:07,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:23:07,368 INFO L168 Benchmark]: Toolchain (without parser) took 14275.24 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 57.5 MB in the beginning and 88.2 MB in the end (delta: -30.6 MB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:07,369 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 94.4 MB. Free memory is still 73.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:23:07,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.64 ms. Allocated memory is still 94.4 MB. Free memory was 57.3 MB in the beginning and 71.8 MB in the end (delta: -14.5 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:07,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.23 ms. Allocated memory is still 94.4 MB. Free memory was 71.8 MB in the beginning and 70.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:23:07,380 INFO L168 Benchmark]: Boogie Preprocessor took 56.56 ms. Allocated memory is still 94.4 MB. Free memory was 70.5 MB in the beginning and 69.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:07,381 INFO L168 Benchmark]: RCFGBuilder took 388.20 ms. Allocated memory is still 94.4 MB. Free memory was 69.4 MB in the beginning and 58.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:07,382 INFO L168 Benchmark]: BuchiAutomizer took 13297.93 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 58.5 MB in the beginning and 90.3 MB in the end (delta: -31.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:07,383 INFO L168 Benchmark]: Witness Printer took 69.62 ms. Allocated memory is still 136.3 MB. Free memory was 90.3 MB in the beginning and 88.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:07,386 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 94.4 MB. Free memory is still 73.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 380.64 ms. Allocated memory is still 94.4 MB. Free memory was 57.3 MB in the beginning and 71.8 MB in the end (delta: -14.5 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.23 ms. Allocated memory is still 94.4 MB. Free memory was 71.8 MB in the beginning and 70.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.56 ms. Allocated memory is still 94.4 MB. Free memory was 70.5 MB in the beginning and 69.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 388.20 ms. Allocated memory is still 94.4 MB. Free memory was 69.4 MB in the beginning and 58.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 13297.93 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 58.5 MB in the beginning and 90.3 MB in the end (delta: -31.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.1 GB. * Witness Printer took 69.62 ms. Allocated memory is still 136.3 MB. Free memory was 90.3 MB in the beginning and 88.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.1s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 12.1s. Construction of modules took 0.4s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn59 mio100 lsp69 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@12242e45=0, NULL=0, \result=0, NULL=1, n=10, i=2, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fec6a32=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2b53adf9=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59bfd4dc=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44e96b6d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@5b404c1e=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...