./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_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:04,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:59:04,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:59:04,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:59:04,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:59:04,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:59:04,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:59:04,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:59:04,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:59:04,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:59:04,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:59:04,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:59:04,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:59:04,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:59:04,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:59:04,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:59:04,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:59:04,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:59:04,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:59:04,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:59:04,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:59:04,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:59:04,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:59:04,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:59:04,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:59:04,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:59:04,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:59:04,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:59:04,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:59:04,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:59:04,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:59:04,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:59:04,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:59:04,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:59:04,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:59:04,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:59:04,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:59:04,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:59:04,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:59:04,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:59:04,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:59:04,871 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-28 02:59:04,895 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:59:04,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:59:04,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:59:04,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:59:04,897 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:59:04,897 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 02:59:04,897 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 02:59:04,897 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 02:59:04,897 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 02:59:04,898 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 02:59:04,898 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 02:59:04,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:59:04,913 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 02:59:04,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:59:04,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:59:04,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 02:59:04,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 02:59:04,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 02:59:04,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:59:04,914 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 02:59:04,914 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:59:04,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 02:59:04,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:59:04,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:59:04,915 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 02:59:04,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:59:04,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:59:04,916 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:59:04,916 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 02:59:04,917 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 02:59:04,917 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_a69f496a-7f33-468d-865e-ca966ce4eae5/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_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:05,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:59:05,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:59:05,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:59:05,179 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:59:05,180 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:59:05,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-11-28 02:59:05,255 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/data/5120b6b68/0197caa6d3cc4a72a6dcf622ba1dd8db/FLAGadd0ad311 [2020-11-28 02:59:05,643 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:59:05,644 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-11-28 02:59:05,653 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/data/5120b6b68/0197caa6d3cc4a72a6dcf622ba1dd8db/FLAGadd0ad311 [2020-11-28 02:59:06,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/data/5120b6b68/0197caa6d3cc4a72a6dcf622ba1dd8db [2020-11-28 02:59:06,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:59:06,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:59:06,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:59:06,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:59:06,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:59:06,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413bd796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06, skipping insertion in model container [2020-11-28 02:59:06,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:59:06,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:59:06,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:59:06,259 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:59:06,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:59:06,285 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:59:06,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06 WrapperNode [2020-11-28 02:59:06,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:59:06,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:59:06,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:59:06,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:59:06,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:59:06,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:59:06,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:59:06,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:59:06,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... [2020-11-28 02:59:06,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:59:06,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:59:06,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:59:06,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:59:06,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 02:59:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:59:06,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:59:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-28 02:59:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:59:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 02:59:06,636 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:59:06,637 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-28 02:59:06,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:06 BoogieIcfgContainer [2020-11-28 02:59:06,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:59:06,641 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 02:59:06,641 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 02:59:06,644 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 02:59:06,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 02:59:06,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:59:06" (1/3) ... [2020-11-28 02:59:06,647 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cd1d212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:59:06, skipping insertion in model container [2020-11-28 02:59:06,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 02:59:06,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:06" (2/3) ... [2020-11-28 02:59:06,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cd1d212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:59:06, skipping insertion in model container [2020-11-28 02:59:06,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 02:59:06,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:06" (3/3) ... [2020-11-28 02:59:06,649 INFO L373 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2020-11-28 02:59:06,721 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 02:59:06,721 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 02:59:06,721 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 02:59:06,734 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:59:06,735 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:59:06,735 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 02:59:06,735 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:59:06,735 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 02:59:06,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-28 02:59:06,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-28 02:59:06,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:06,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:06,778 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 02:59:06,778 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 02:59:06,778 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 02:59:06,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-28 02:59:06,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-28 02:59:06,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:06,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:06,781 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 02:59:06,781 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 02:59:06,789 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-28 02:59:06,790 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-28 02:59:06,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:06,801 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-28 02:59:06,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:06,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266767010] [2020-11-28 02:59:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:06,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:06,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:07,004 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-28 02:59:07,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:07,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135512797] [2020-11-28 02:59:07,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:07,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:07,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:07,058 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-28 02:59:07,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:07,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012550651] [2020-11-28 02:59:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:07,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:07,125 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:07,131 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:07,383 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 02:59:07,391 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 02:59:07,393 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 02:59:07,393 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 02:59:07,394 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 02:59:07,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:07,394 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 02:59:07,394 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 02:59:07,394 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2020-11-28 02:59:07,395 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 02:59:07,395 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 02:59:07,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 02:59:07,718 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 02:59:07,723 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:07,735 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:07,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:07,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:59:07,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:07,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:07,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:07,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:59:07,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 02:59:07,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:07,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:07,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:07,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:59:07,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:07,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:07,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:07,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:59:07,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 02:59:07,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:07,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:07,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:07,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:59:07,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:07,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:07,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:07,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:59:07,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 02:59:07,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:07,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:07,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:07,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:59:07,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:07,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:07,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:07,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:59:07,883 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-28 02:59:07,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:07,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:07,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:07,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:07,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:07,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:07,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:59:07,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:59:07,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:08,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:08,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:08,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:59:08,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:08,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:08,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:08,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:59:08,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 02:59:08,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:08,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:08,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:08,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:08,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:08,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:08,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:59:08,063 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-28 02:59:08,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:08,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:08,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:08,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:08,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:08,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:08,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:59:08,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:59:08,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:08,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:08,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:08,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:08,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:08,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:08,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:59:08,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:59:08,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:08,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:08,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:08,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:59:08,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:08,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:08,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:08,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:59:08,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 02:59:08,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 02:59:08,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:08,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:08,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:59:08,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:08,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:08,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:08,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:59:08,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:08,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:59:08,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:59:08,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:59:08,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:59:08,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:59:08,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:59:08,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:59:08,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:59:08,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 02:59:08,390 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-11-28 02:59:08,390 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_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:08,428 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-28 02:59:08,431 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-28 02:59:08,432 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 02:59:08,432 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-28 02:59:08,475 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-11-28 02:59:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:08,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 02:59:08,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:08,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 02:59:08,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:08,591 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-28 02:59:08,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2020-11-28 02:59:08,644 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-28 02:59:08,647 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-28 02:59:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 02:59:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-11-28 02:59:08,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-28 02:59:08,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:59:08,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-28 02:59:08,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:59:08,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-28 02:59:08,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:59:08,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2020-11-28 02:59:08,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:08,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2020-11-28 02:59:08,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:08,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-28 02:59:08,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-11-28 02:59:08,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:08,667 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-11-28 02:59:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-11-28 02:59:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-11-28 02:59:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-28 02:59:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-11-28 02:59:08,694 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-11-28 02:59:08,694 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-11-28 02:59:08,694 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 02:59:08,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-11-28 02:59:08,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:08,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:08,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:08,698 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-28 02:59:08,698 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:08,698 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-28 02:59:08,698 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~mem3;havoc main_#t~short4;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-28 02:59:08,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2020-11-28 02:59:08,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:08,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910107629] [2020-11-28 02:59:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:08,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910107629] [2020-11-28 02:59:08,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:08,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:59:08,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265106125] [2020-11-28 02:59:08,757 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:08,758 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-11-28 02:59:08,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:08,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995823360] [2020-11-28 02:59:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:08,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:08,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:08,780 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:08,899 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:08,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:59:08,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:59:08,944 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-28 02:59:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:08,959 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-11-28 02:59:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:59:08,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-11-28 02:59:08,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:08,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2020-11-28 02:59:08,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:08,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:08,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-11-28 02:59:08,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:08,962 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-11-28 02:59:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-11-28 02:59:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-11-28 02:59:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-28 02:59:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-11-28 02:59:08,964 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-11-28 02:59:08,964 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-11-28 02:59:08,964 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 02:59:08,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-11-28 02:59:08,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:08,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:08,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:08,967 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-28 02:59:08,968 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:08,968 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-28 02:59:08,968 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~mem3;havoc main_#t~short4;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-28 02:59:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:08,969 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2020-11-28 02:59:08,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:08,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843371861] [2020-11-28 02:59:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:09,016 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-28 02:59:09,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843371861] [2020-11-28 02:59:09,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147312198] [2020-11-28 02:59:09,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:09,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-28 02:59:09,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:09,102 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-28 02:59:09,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:59:09,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-11-28 02:59:09,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867434162] [2020-11-28 02:59:09,104 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:09,104 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-11-28 02:59:09,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:09,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034000507] [2020-11-28 02:59:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:09,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:09,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:09,159 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:09,289 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:09,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:09,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:59:09,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:59:09,325 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-11-28 02:59:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:09,356 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-11-28 02:59:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:59:09,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-11-28 02:59:09,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:09,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-11-28 02:59:09,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:09,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:09,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-11-28 02:59:09,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:09,361 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-11-28 02:59:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-11-28 02:59:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-11-28 02:59:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-28 02:59:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-11-28 02:59:09,363 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-11-28 02:59:09,363 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-11-28 02:59:09,363 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 02:59:09,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-11-28 02:59:09,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:09,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:09,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:09,364 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-11-28 02:59:09,364 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:09,365 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-28 02:59:09,365 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~mem3;havoc main_#t~short4;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-28 02:59:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2020-11-28 02:59:09,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:09,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261548048] [2020-11-28 02:59:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:09,424 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-28 02:59:09,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261548048] [2020-11-28 02:59:09,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997027369] [2020-11-28 02:59:09,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:09,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 02:59:09,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:59:09,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 02:59:09,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:09,487 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-28 02:59:09,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:59:09,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-28 02:59:09,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997616677] [2020-11-28 02:59:09,488 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-11-28 02:59:09,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:09,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074839547] [2020-11-28 02:59:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:09,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:09,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:09,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:09,634 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:09,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:09,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:59:09,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:59:09,671 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-11-28 02:59:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:09,700 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-11-28 02:59:09,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:59:09,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-11-28 02:59:09,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:09,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2020-11-28 02:59:09,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:09,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:09,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-11-28 02:59:09,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:09,704 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-11-28 02:59:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-11-28 02:59:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-11-28 02:59:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-11-28 02:59:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-11-28 02:59:09,705 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-11-28 02:59:09,705 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-11-28 02:59:09,706 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 02:59:09,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-11-28 02:59:09,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:09,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:09,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:09,707 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2020-11-28 02:59:09,707 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:09,707 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-28 02:59:09,707 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~mem3;havoc main_#t~short4;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-28 02:59:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:09,707 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2020-11-28 02:59:09,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:09,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792160827] [2020-11-28 02:59:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:09,773 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-28 02:59:09,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792160827] [2020-11-28 02:59:09,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265353330] [2020-11-28 02:59:09,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:09,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-28 02:59:09,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:59:09,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-28 02:59:09,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:09,850 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-28 02:59:09,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:59:09,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-28 02:59:09,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584496384] [2020-11-28 02:59:09,851 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-11-28 02:59:09,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:09,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686611559] [2020-11-28 02:59:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:09,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:09,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:09,870 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:09,988 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:10,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 02:59:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:59:10,030 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-11-28 02:59:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:10,074 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-11-28 02:59:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:59:10,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-11-28 02:59:10,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:10,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2020-11-28 02:59:10,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:10,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:10,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2020-11-28 02:59:10,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:10,079 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-11-28 02:59:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2020-11-28 02:59:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-11-28 02:59:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-28 02:59:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-11-28 02:59:10,081 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-28 02:59:10,081 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-28 02:59:10,081 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 02:59:10,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-11-28 02:59:10,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:10,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:10,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:10,082 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2020-11-28 02:59:10,082 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:10,082 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-28 02:59:10,082 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~mem3;havoc main_#t~short4;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-28 02:59:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:10,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2020-11-28 02:59:10,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:10,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635560517] [2020-11-28 02:59:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:10,166 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-28 02:59:10,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635560517] [2020-11-28 02:59:10,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308496796] [2020-11-28 02:59:10,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:10,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 02:59:10,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:59:10,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 02:59:10,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:10,240 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-28 02:59:10,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:59:10,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-28 02:59:10,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668829765] [2020-11-28 02:59:10,241 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:10,242 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2020-11-28 02:59:10,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:10,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222110457] [2020-11-28 02:59:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:10,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:10,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:10,260 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:10,366 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:10,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:10,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 02:59:10,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:59:10,403 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-11-28 02:59:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:10,437 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-11-28 02:59:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:59:10,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-11-28 02:59:10,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:10,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-11-28 02:59:10,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:10,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:10,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-11-28 02:59:10,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:10,442 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-11-28 02:59:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-11-28 02:59:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-28 02:59:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-28 02:59:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-11-28 02:59:10,444 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-28 02:59:10,444 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-28 02:59:10,444 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 02:59:10,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-11-28 02:59:10,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:10,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:10,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:10,451 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2020-11-28 02:59:10,451 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:10,452 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-28 02:59:10,452 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~mem3;havoc main_#t~short4;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-28 02:59:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:10,452 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2020-11-28 02:59:10,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:10,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089492311] [2020-11-28 02:59:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:10,540 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-28 02:59:10,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089492311] [2020-11-28 02:59:10,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485929435] [2020-11-28 02:59:10,541 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:10,602 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-28 02:59:10,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:59:10,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 02:59:10,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:10,625 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-28 02:59:10,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:59:10,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-28 02:59:10,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465847711] [2020-11-28 02:59:10,627 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:10,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:10,627 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2020-11-28 02:59:10,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:10,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425440805] [2020-11-28 02:59:10,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:10,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:10,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:10,653 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:10,764 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:10,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:10,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:59:10,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:59:10,791 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-11-28 02:59:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:10,845 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-11-28 02:59:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:59:10,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-11-28 02:59:10,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:10,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2020-11-28 02:59:10,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:10,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:10,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-11-28 02:59:10,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:10,848 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-11-28 02:59:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-11-28 02:59:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-11-28 02:59:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-28 02:59:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-11-28 02:59:10,850 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-28 02:59:10,850 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-28 02:59:10,850 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 02:59:10,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-11-28 02:59:10,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:10,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:10,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:10,851 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2020-11-28 02:59:10,851 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:10,851 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-28 02:59:10,851 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~mem3;havoc main_#t~short4;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-28 02:59:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2020-11-28 02:59:10,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:10,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857451894] [2020-11-28 02:59:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:10,948 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-28 02:59:10,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857451894] [2020-11-28 02:59:10,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609355314] [2020-11-28 02:59:10,948 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:59:11,001 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-11-28 02:59:11,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:59:11,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-28 02:59:11,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:11,041 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-28 02:59:11,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:59:11,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-11-28 02:59:11,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214867843] [2020-11-28 02:59:11,045 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:11,047 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2020-11-28 02:59:11,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:11,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949059173] [2020-11-28 02:59:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:11,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:11,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:11,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:11,186 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:11,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:11,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-28 02:59:11,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-28 02:59:11,243 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2020-11-28 02:59:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:11,289 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-11-28 02:59:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 02:59:11,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-11-28 02:59:11,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:11,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2020-11-28 02:59:11,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:11,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:11,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-11-28 02:59:11,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:11,293 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-28 02:59:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-11-28 02:59:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-11-28 02:59:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-28 02:59:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-11-28 02:59:11,295 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-11-28 02:59:11,295 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-11-28 02:59:11,295 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-28 02:59:11,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-11-28 02:59:11,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:11,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:11,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:11,297 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2020-11-28 02:59:11,297 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:11,297 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-28 02:59:11,297 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~mem3;havoc main_#t~short4;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-28 02:59:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2020-11-28 02:59:11,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:11,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135544736] [2020-11-28 02:59:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:11,436 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-28 02:59:11,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135544736] [2020-11-28 02:59:11,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325884140] [2020-11-28 02:59:11,436 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:11,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 02:59:11,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:11,513 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-28 02:59:11,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:59:11,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-28 02:59:11,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414927728] [2020-11-28 02:59:11,514 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2020-11-28 02:59:11,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:11,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740941776] [2020-11-28 02:59:11,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:11,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:11,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:11,524 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:11,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:11,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 02:59:11,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:59:11,643 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-11-28 02:59:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:11,690 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-11-28 02:59:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 02:59:11,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-11-28 02:59:11,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:11,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2020-11-28 02:59:11,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:11,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:11,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-11-28 02:59:11,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:11,693 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-11-28 02:59:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-11-28 02:59:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-28 02:59:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-28 02:59:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-11-28 02:59:11,695 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-28 02:59:11,695 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-28 02:59:11,695 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-28 02:59:11,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-11-28 02:59:11,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:11,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:11,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:11,697 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2020-11-28 02:59:11,697 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:11,697 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-28 02:59:11,697 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~mem3;havoc main_#t~short4;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-28 02:59:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2020-11-28 02:59:11,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:11,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549372513] [2020-11-28 02:59:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:11,808 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-28 02:59:11,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549372513] [2020-11-28 02:59:11,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504559712] [2020-11-28 02:59:11,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:11,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 02:59:11,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:59:11,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-28 02:59:11,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:11,886 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-28 02:59:11,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:59:11,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-28 02:59:11,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038733387] [2020-11-28 02:59:11,887 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:11,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:11,888 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2020-11-28 02:59:11,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:11,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302060395] [2020-11-28 02:59:11,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:11,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:11,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:11,898 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:12,018 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:12,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-28 02:59:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-28 02:59:12,048 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-11-28 02:59:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:12,094 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-11-28 02:59:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-28 02:59:12,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-11-28 02:59:12,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:12,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-11-28 02:59:12,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:12,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:12,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-11-28 02:59:12,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:12,096 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-11-28 02:59:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-11-28 02:59:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-11-28 02:59:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-28 02:59:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-11-28 02:59:12,098 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-28 02:59:12,098 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-28 02:59:12,098 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-28 02:59:12,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-11-28 02:59:12,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:12,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:12,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:12,100 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2020-11-28 02:59:12,100 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:12,100 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-28 02:59:12,100 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~mem3;havoc main_#t~short4;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-28 02:59:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2020-11-28 02:59:12,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:12,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976757177] [2020-11-28 02:59:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:12,236 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-28 02:59:12,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976757177] [2020-11-28 02:59:12,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268169404] [2020-11-28 02:59:12,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/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-28 02:59:12,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-11-28 02:59:12,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:59:12,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-28 02:59:12,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:59:12,376 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-28 02:59:12,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:59:12,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-28 02:59:12,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768275217] [2020-11-28 02:59:12,377 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:59:12,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:12,378 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2020-11-28 02:59:12,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:12,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181396566] [2020-11-28 02:59:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:12,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:12,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:12,400 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:12,512 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:12,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-28 02:59:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-28 02:59:12,549 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-11-28 02:59:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:12,604 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-11-28 02:59:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-28 02:59:12,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-11-28 02:59:12,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:12,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2020-11-28 02:59:12,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-28 02:59:12,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-28 02:59:12,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2020-11-28 02:59:12,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:59:12,606 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-28 02:59:12,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2020-11-28 02:59:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-11-28 02:59:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-28 02:59:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-11-28 02:59:12,608 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-28 02:59:12,608 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-28 02:59:12,609 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-28 02:59:12,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-11-28 02:59:12,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:59:12,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:59:12,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:59:12,610 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2020-11-28 02:59:12,610 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:59:12,610 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-28 02:59:12,610 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~mem3;havoc main_#t~short4;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-28 02:59:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2020-11-28 02:59:12,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:12,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370257923] [2020-11-28 02:59:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:12,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:12,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:12,665 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2020-11-28 02:59:12,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:12,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072963738] [2020-11-28 02:59:12,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:12,677 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:12,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:12,686 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:12,688 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2020-11-28 02:59:12,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:12,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502063049] [2020-11-28 02:59:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:12,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:12,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:12,743 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:12,845 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-28 02:59:16,787 WARN L193 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 212 DAG size of output: 146 [2020-11-28 02:59:16,948 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-11-28 02:59:16,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:59:16 BoogieIcfgContainer [2020-11-28 02:59:16,985 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 02:59:16,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:59:16,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:59:16,986 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:59:16,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:06" (3/4) ... [2020-11-28 02:59:16,990 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-28 02:59:17,028 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a69f496a-7f33-468d-865e-ca966ce4eae5/bin/uautomizer/witness.graphml [2020-11-28 02:59:17,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:59:17,029 INFO L168 Benchmark]: Toolchain (without parser) took 10967.70 ms. Allocated memory was 86.0 MB in the beginning and 142.6 MB in the end (delta: 56.6 MB). Free memory was 66.1 MB in the beginning and 63.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 57.2 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:17,030 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 86.0 MB. Free memory was 60.9 MB in the beginning and 60.9 MB in the end (delta: 52.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:59:17,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.50 ms. Allocated memory is still 86.0 MB. Free memory was 66.0 MB in the beginning and 57.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:17,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.91 ms. Allocated memory is still 86.0 MB. Free memory was 57.0 MB in the beginning and 55.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:17,031 INFO L168 Benchmark]: Boogie Preprocessor took 20.51 ms. Allocated memory is still 86.0 MB. Free memory was 55.6 MB in the beginning and 54.5 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:59:17,032 INFO L168 Benchmark]: RCFGBuilder took 302.28 ms. Allocated memory is still 86.0 MB. Free memory was 54.5 MB in the beginning and 43.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:17,032 INFO L168 Benchmark]: BuchiAutomizer took 10344.22 ms. Allocated memory was 86.0 MB in the beginning and 142.6 MB in the end (delta: 56.6 MB). Free memory was 43.7 MB in the beginning and 65.8 MB in the end (delta: -22.1 MB). Peak memory consumption was 63.5 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:17,033 INFO L168 Benchmark]: Witness Printer took 42.22 ms. Allocated memory is still 142.6 MB. Free memory was 65.8 MB in the beginning and 63.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:17,035 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.19 ms. Allocated memory is still 86.0 MB. Free memory was 60.9 MB in the beginning and 60.9 MB in the end (delta: 52.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 201.50 ms. Allocated memory is still 86.0 MB. Free memory was 66.0 MB in the beginning and 57.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 26.91 ms. Allocated memory is still 86.0 MB. Free memory was 57.0 MB in the beginning and 55.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.51 ms. Allocated memory is still 86.0 MB. Free memory was 55.6 MB in the beginning and 54.5 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 302.28 ms. Allocated memory is still 86.0 MB. Free memory was 54.5 MB in the beginning and 43.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 10344.22 ms. Allocated memory was 86.0 MB in the beginning and 142.6 MB in the end (delta: 56.6 MB). Free memory was 43.7 MB in the beginning and 65.8 MB in the end (delta: -22.1 MB). Peak memory consumption was 63.5 MB. Max. memory is 16.1 GB. * Witness Printer took 42.22 ms. Allocated memory is still 142.6 MB. Free memory was 65.8 MB in the beginning and 63.7 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 10.2s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 9.4s. Construction of modules took 0.2s. 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.2s 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: 28ms 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@375387a5=0, NULL=0, \result=0, NULL=1, n=10, i=2, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ff130ea=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@38f67fea=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55a1c2d5=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21dc1e05=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@399f03b0=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...