./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/id_build.i -s /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e693e301fe03afa61a3f7e2110361a5e60df7f9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:10:25,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:10:25,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:10:25,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:10:25,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:10:25,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:10:25,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:10:25,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:10:25,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:10:25,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:10:25,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:10:25,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:10:25,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:10:25,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:10:25,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:10:25,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:10:25,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:10:25,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:10:25,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:10:25,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:10:25,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:10:25,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:10:25,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:10:25,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:10:25,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:10:25,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:10:25,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:10:25,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:10:25,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:10:25,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:10:25,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:10:25,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:10:25,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:10:25,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:10:25,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:10:25,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:10:25,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:10:25,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:10:25,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:10:25,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:10:25,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:10:25,716 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 00:10:25,768 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:10:25,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:10:25,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:10:25,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:10:25,771 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:10:25,772 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:10:25,772 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:10:25,772 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:10:25,773 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:10:25,773 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:10:25,774 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:10:25,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:10:25,775 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:10:25,775 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:10:25,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:10:25,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:10:25,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:10:25,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:10:25,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:10:25,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:10:25,777 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:10:25,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:10:25,778 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:10:25,778 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:10:25,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:10:25,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:10:25,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:10:25,779 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:10:25,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:10:25,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:10:25,782 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:10:25,782 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:10:25,784 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:10:25,784 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_06cd3934-3108-401a-9bc6-43c8f781b666/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_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e693e301fe03afa61a3f7e2110361a5e60df7f9 [2020-11-30 00:10:26,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:10:26,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:10:26,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:10:26,237 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:10:26,238 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:10:26,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/id_build.i [2020-11-30 00:10:26,323 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/data/4ce7ac666/d3be0713b3304c40a5497b7f082fdd5d/FLAGb4326b29d [2020-11-30 00:10:26,907 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:10:26,907 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/sv-benchmarks/c/loop-invgen/id_build.i [2020-11-30 00:10:26,921 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/data/4ce7ac666/d3be0713b3304c40a5497b7f082fdd5d/FLAGb4326b29d [2020-11-30 00:10:27,235 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/data/4ce7ac666/d3be0713b3304c40a5497b7f082fdd5d [2020-11-30 00:10:27,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:10:27,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:10:27,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:10:27,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:10:27,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:10:27,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ecb17dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27, skipping insertion in model container [2020-11-30 00:10:27,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:10:27,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:10:27,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:10:27,556 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:10:27,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:10:27,593 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:10:27,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27 WrapperNode [2020-11-30 00:10:27,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:10:27,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:10:27,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:10:27,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:10:27,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:10:27,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:10:27,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:10:27,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:10:27,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... [2020-11-30 00:10:27,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:10:27,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:10:27,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:10:27,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:10:27,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:10:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:10:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:10:27,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:10:28,073 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:10:28,074 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 00:10:28,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:10:28 BoogieIcfgContainer [2020-11-30 00:10:28,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:10:28,080 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:10:28,081 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:10:28,085 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:10:28,086 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:10:28,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:10:27" (1/3) ... [2020-11-30 00:10:28,088 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f2e02b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:10:28, skipping insertion in model container [2020-11-30 00:10:28,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:10:28,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:10:27" (2/3) ... [2020-11-30 00:10:28,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f2e02b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:10:28, skipping insertion in model container [2020-11-30 00:10:28,102 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:10:28,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:10:28" (3/3) ... [2020-11-30 00:10:28,104 INFO L373 chiAutomizerObserver]: Analyzing ICFG id_build.i [2020-11-30 00:10:28,200 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:10:28,200 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:10:28,200 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:10:28,200 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:10:28,200 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:10:28,200 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:10:28,201 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:10:28,201 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:10:28,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-11-30 00:10:28,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-11-30 00:10:28,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:28,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:28,248 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:28,248 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:10:28,248 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:10:28,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-11-30 00:10:28,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-11-30 00:10:28,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:28,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:28,252 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:28,253 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:10:28,261 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 11#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 19#L27-3true [2020-11-30 00:10:28,262 INFO L796 eck$LassoCheckResult]: Loop: 19#L27-3true assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 4#L28-2true assume !(main_~j~0 < 8); 21#L27-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 19#L27-3true [2020-11-30 00:10:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-30 00:10:28,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:28,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077209082] [2020-11-30 00:10:28,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:28,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:28,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:28,461 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash 39954, now seen corresponding path program 1 times [2020-11-30 00:10:28,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:28,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484013444] [2020-11-30 00:10:28,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:28,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484013444] [2020-11-30 00:10:28,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:10:28,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:10:28,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047615105] [2020-11-30 00:10:28,536 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:10:28,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:10:28,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:10:28,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:10:28,558 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-11-30 00:10:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:10:28,639 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-11-30 00:10:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:10:28,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2020-11-30 00:10:28,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-11-30 00:10:28,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 14 states and 15 transitions. [2020-11-30 00:10:28,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-11-30 00:10:28,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-11-30 00:10:28,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2020-11-30 00:10:28,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:10:28,654 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-11-30 00:10:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2020-11-30 00:10:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2020-11-30 00:10:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-30 00:10:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-11-30 00:10:28,687 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-11-30 00:10:28,688 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-11-30 00:10:28,688 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:10:28,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-11-30 00:10:28,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 00:10:28,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:28,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:28,690 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:28,690 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:10:28,690 INFO L794 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 56#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 57#L27-3 [2020-11-30 00:10:28,691 INFO L796 eck$LassoCheckResult]: Loop: 57#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 58#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 59#L18 assume !(0 == __VERIFIER_assert_~cond); 60#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 54#L18-3 assume !(0 == __VERIFIER_assert_~cond); 55#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 62#L28-2 assume !(main_~j~0 < 8); 63#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 57#L27-3 [2020-11-30 00:10:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-30 00:10:28,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:28,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139253436] [2020-11-30 00:10:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:28,709 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:28,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:28,727 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1814055911, now seen corresponding path program 1 times [2020-11-30 00:10:28,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:28,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289025653] [2020-11-30 00:10:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:28,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289025653] [2020-11-30 00:10:28,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787880419] [2020-11-30 00:10:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:10:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:28,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:10:28,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:28,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:10:28,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-11-30 00:10:28,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776261478] [2020-11-30 00:10:28,959 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:10:28,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:10:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:10:28,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:10:28,961 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-11-30 00:10:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:10:29,012 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-11-30 00:10:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:10:29,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2020-11-30 00:10:29,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-11-30 00:10:29,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2020-11-30 00:10:29,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-11-30 00:10:29,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-11-30 00:10:29,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2020-11-30 00:10:29,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:10:29,018 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-11-30 00:10:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2020-11-30 00:10:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2020-11-30 00:10:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 00:10:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-11-30 00:10:29,022 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-11-30 00:10:29,022 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-11-30 00:10:29,022 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:10:29,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-11-30 00:10:29,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-11-30 00:10:29,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:29,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:29,025 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:29,025 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2020-11-30 00:10:29,026 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 113#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 114#L27-3 [2020-11-30 00:10:29,027 INFO L796 eck$LassoCheckResult]: Loop: 114#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 120#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 125#L18 assume !(0 == __VERIFIER_assert_~cond); 124#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 123#L18-3 assume !(0 == __VERIFIER_assert_~cond); 119#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 115#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 116#L18 assume !(0 == __VERIFIER_assert_~cond); 117#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 111#L18-3 assume !(0 == __VERIFIER_assert_~cond); 112#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 122#L28-2 assume !(main_~j~0 < 8); 121#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 114#L27-3 [2020-11-30 00:10:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-30 00:10:29,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:29,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067099468] [2020-11-30 00:10:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:29,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:29,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:29,093 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1818130318, now seen corresponding path program 2 times [2020-11-30 00:10:29,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:29,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830926622] [2020-11-30 00:10:29,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:29,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830926622] [2020-11-30 00:10:29,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477319755] [2020-11-30 00:10:29,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:10:29,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:10:29,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:10:29,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:10:29,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:29,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:10:29,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-11-30 00:10:29,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946123306] [2020-11-30 00:10:29,263 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:10:29,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:10:29,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:10:29,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:10:29,267 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-11-30 00:10:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:10:29,310 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-11-30 00:10:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:10:29,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2020-11-30 00:10:29,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-11-30 00:10:29,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2020-11-30 00:10:29,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-11-30 00:10:29,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-11-30 00:10:29,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2020-11-30 00:10:29,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:10:29,315 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-11-30 00:10:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2020-11-30 00:10:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2020-11-30 00:10:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-30 00:10:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-11-30 00:10:29,319 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-11-30 00:10:29,319 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-11-30 00:10:29,319 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:10:29,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2020-11-30 00:10:29,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-11-30 00:10:29,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:29,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:29,321 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:29,322 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 1, 1, 1] [2020-11-30 00:10:29,322 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 196#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 197#L27-3 [2020-11-30 00:10:29,322 INFO L796 eck$LassoCheckResult]: Loop: 197#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 203#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 213#L18 assume !(0 == __VERIFIER_assert_~cond); 212#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 211#L18-3 assume !(0 == __VERIFIER_assert_~cond); 202#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 198#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 199#L18 assume !(0 == __VERIFIER_assert_~cond); 201#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 194#L18-3 assume !(0 == __VERIFIER_assert_~cond); 195#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 210#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 206#L18 assume !(0 == __VERIFIER_assert_~cond); 209#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 208#L18-3 assume !(0 == __VERIFIER_assert_~cond); 207#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 205#L28-2 assume !(main_~j~0 < 8); 204#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 197#L27-3 [2020-11-30 00:10:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-30 00:10:29,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:29,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006155108] [2020-11-30 00:10:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:29,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:29,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:29,347 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1614576711, now seen corresponding path program 3 times [2020-11-30 00:10:29,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:29,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469373196] [2020-11-30 00:10:29,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:29,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469373196] [2020-11-30 00:10:29,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056690968] [2020-11-30 00:10:29,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:10:29,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-30 00:10:29,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:10:29,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:10:29,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:29,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:10:29,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-11-30 00:10:29,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710593169] [2020-11-30 00:10:29,586 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:10:29,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:10:29,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:10:29,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:10:29,590 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-11-30 00:10:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:10:29,644 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-11-30 00:10:29,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:10:29,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2020-11-30 00:10:29,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-11-30 00:10:29,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2020-11-30 00:10:29,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-11-30 00:10:29,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-11-30 00:10:29,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2020-11-30 00:10:29,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:10:29,648 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-11-30 00:10:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2020-11-30 00:10:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-11-30 00:10:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-30 00:10:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-11-30 00:10:29,651 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-11-30 00:10:29,652 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-11-30 00:10:29,652 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:10:29,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2020-11-30 00:10:29,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-11-30 00:10:29,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:29,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:29,654 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:29,655 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 1, 1, 1] [2020-11-30 00:10:29,655 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 303#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 304#L27-3 [2020-11-30 00:10:29,655 INFO L796 eck$LassoCheckResult]: Loop: 304#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 312#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 327#L18 assume !(0 == __VERIFIER_assert_~cond); 326#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 325#L18-3 assume !(0 == __VERIFIER_assert_~cond); 311#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 307#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 308#L18 assume !(0 == __VERIFIER_assert_~cond); 310#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 305#L18-3 assume !(0 == __VERIFIER_assert_~cond); 306#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 324#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 323#L18 assume !(0 == __VERIFIER_assert_~cond); 322#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 321#L18-3 assume !(0 == __VERIFIER_assert_~cond); 320#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 319#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 315#L18 assume !(0 == __VERIFIER_assert_~cond); 318#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 317#L18-3 assume !(0 == __VERIFIER_assert_~cond); 316#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 314#L28-2 assume !(main_~j~0 < 8); 313#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 304#L27-3 [2020-11-30 00:10:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:29,656 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-11-30 00:10:29,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:29,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313008721] [2020-11-30 00:10:29,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:29,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:29,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:29,688 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash -909214510, now seen corresponding path program 4 times [2020-11-30 00:10:29,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:29,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538813086] [2020-11-30 00:10:29,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:29,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538813086] [2020-11-30 00:10:29,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002093094] [2020-11-30 00:10:29,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:10:29,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:10:29,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:10:29,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 00:10:29,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:29,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:10:29,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-11-30 00:10:29,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621002185] [2020-11-30 00:10:29,909 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:10:29,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:10:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:10:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:10:29,912 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 7 states. [2020-11-30 00:10:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:10:29,962 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-11-30 00:10:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:10:29,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2020-11-30 00:10:29,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-11-30 00:10:29,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 35 transitions. [2020-11-30 00:10:29,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-11-30 00:10:29,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-11-30 00:10:29,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 35 transitions. [2020-11-30 00:10:29,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:10:29,968 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-11-30 00:10:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 35 transitions. [2020-11-30 00:10:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2020-11-30 00:10:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-30 00:10:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-11-30 00:10:29,971 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-11-30 00:10:29,971 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-11-30 00:10:29,971 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:10:29,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2020-11-30 00:10:29,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-11-30 00:10:29,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:29,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:29,976 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:29,976 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 1, 1, 1] [2020-11-30 00:10:29,976 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 438#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 439#L27-3 [2020-11-30 00:10:29,977 INFO L796 eck$LassoCheckResult]: Loop: 439#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 447#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 467#L18 assume !(0 == __VERIFIER_assert_~cond); 466#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 465#L18-3 assume !(0 == __VERIFIER_assert_~cond); 446#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 442#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 443#L18 assume !(0 == __VERIFIER_assert_~cond); 445#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 440#L18-3 assume !(0 == __VERIFIER_assert_~cond); 441#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 464#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 463#L18 assume !(0 == __VERIFIER_assert_~cond); 462#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 461#L18-3 assume !(0 == __VERIFIER_assert_~cond); 460#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 459#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 458#L18 assume !(0 == __VERIFIER_assert_~cond); 457#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 456#L18-3 assume !(0 == __VERIFIER_assert_~cond); 455#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 454#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 450#L18 assume !(0 == __VERIFIER_assert_~cond); 453#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 452#L18-3 assume !(0 == __VERIFIER_assert_~cond); 451#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 449#L28-2 assume !(main_~j~0 < 8); 448#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 439#L27-3 [2020-11-30 00:10:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-11-30 00:10:29,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:29,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489410480] [2020-11-30 00:10:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:29,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:30,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:30,015 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1734363993, now seen corresponding path program 5 times [2020-11-30 00:10:30,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:30,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142931667] [2020-11-30 00:10:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:30,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142931667] [2020-11-30 00:10:30,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88412551] [2020-11-30 00:10:30,130 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:10:30,179 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-30 00:10:30,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:10:30,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:10:30,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:30,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:10:30,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-11-30 00:10:30,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148763542] [2020-11-30 00:10:30,234 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:10:30,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:10:30,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:10:30,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:10:30,239 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-11-30 00:10:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:10:30,305 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-11-30 00:10:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:10:30,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2020-11-30 00:10:30,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-11-30 00:10:30,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 40 transitions. [2020-11-30 00:10:30,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-11-30 00:10:30,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-11-30 00:10:30,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 40 transitions. [2020-11-30 00:10:30,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:10:30,310 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-30 00:10:30,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 40 transitions. [2020-11-30 00:10:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-11-30 00:10:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-30 00:10:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-11-30 00:10:30,314 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-11-30 00:10:30,314 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-11-30 00:10:30,314 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:10:30,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 36 transitions. [2020-11-30 00:10:30,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-11-30 00:10:30,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:30,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:30,321 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:30,321 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 1, 1, 1] [2020-11-30 00:10:30,321 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 601#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 602#L27-3 [2020-11-30 00:10:30,323 INFO L796 eck$LassoCheckResult]: Loop: 602#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 608#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 633#L18 assume !(0 == __VERIFIER_assert_~cond); 632#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 631#L18-3 assume !(0 == __VERIFIER_assert_~cond); 607#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 603#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 604#L18 assume !(0 == __VERIFIER_assert_~cond); 605#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 599#L18-3 assume !(0 == __VERIFIER_assert_~cond); 600#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 630#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 629#L18 assume !(0 == __VERIFIER_assert_~cond); 628#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 627#L18-3 assume !(0 == __VERIFIER_assert_~cond); 626#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 625#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 624#L18 assume !(0 == __VERIFIER_assert_~cond); 623#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 622#L18-3 assume !(0 == __VERIFIER_assert_~cond); 621#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 620#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 619#L18 assume !(0 == __VERIFIER_assert_~cond); 618#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 617#L18-3 assume !(0 == __VERIFIER_assert_~cond); 616#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 615#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 611#L18 assume !(0 == __VERIFIER_assert_~cond); 614#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 613#L18-3 assume !(0 == __VERIFIER_assert_~cond); 612#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 610#L28-2 assume !(main_~j~0 < 8); 609#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 602#L27-3 [2020-11-30 00:10:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-11-30 00:10:30,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:30,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060770301] [2020-11-30 00:10:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:30,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:30,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:30,364 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:30,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:30,366 INFO L82 PathProgramCache]: Analyzing trace with hash 152926514, now seen corresponding path program 6 times [2020-11-30 00:10:30,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:30,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860147920] [2020-11-30 00:10:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:30,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860147920] [2020-11-30 00:10:30,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062564879] [2020-11-30 00:10:30,511 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:10:30,577 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-11-30 00:10:30,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:10:30,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:10:30,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:30,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:10:30,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-11-30 00:10:30,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329454434] [2020-11-30 00:10:30,624 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:10:30,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:10:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:10:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:10:30,625 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. cyclomatic complexity: 2 Second operand 9 states. [2020-11-30 00:10:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:10:30,687 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-30 00:10:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:10:30,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 45 transitions. [2020-11-30 00:10:30,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-11-30 00:10:30,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 45 transitions. [2020-11-30 00:10:30,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-11-30 00:10:30,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-11-30 00:10:30,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 45 transitions. [2020-11-30 00:10:30,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:10:30,690 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-11-30 00:10:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 45 transitions. [2020-11-30 00:10:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-11-30 00:10:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 00:10:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-11-30 00:10:30,694 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-11-30 00:10:30,694 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-11-30 00:10:30,694 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:10:30,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 41 transitions. [2020-11-30 00:10:30,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-11-30 00:10:30,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:30,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:30,697 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:30,697 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 1, 1, 1] [2020-11-30 00:10:30,697 INFO L794 eck$LassoCheckResult]: Stem: 793#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 788#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 789#L27-3 [2020-11-30 00:10:30,697 INFO L796 eck$LassoCheckResult]: Loop: 789#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 795#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 825#L18 assume !(0 == __VERIFIER_assert_~cond); 824#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 823#L18-3 assume !(0 == __VERIFIER_assert_~cond); 794#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 790#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 791#L18 assume !(0 == __VERIFIER_assert_~cond); 792#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 786#L18-3 assume !(0 == __VERIFIER_assert_~cond); 787#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 822#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 821#L18 assume !(0 == __VERIFIER_assert_~cond); 820#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 819#L18-3 assume !(0 == __VERIFIER_assert_~cond); 818#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 817#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 816#L18 assume !(0 == __VERIFIER_assert_~cond); 815#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 814#L18-3 assume !(0 == __VERIFIER_assert_~cond); 813#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 812#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 811#L18 assume !(0 == __VERIFIER_assert_~cond); 810#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 809#L18-3 assume !(0 == __VERIFIER_assert_~cond); 808#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 807#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 806#L18 assume !(0 == __VERIFIER_assert_~cond); 805#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 804#L18-3 assume !(0 == __VERIFIER_assert_~cond); 803#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 802#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 798#L18 assume !(0 == __VERIFIER_assert_~cond); 801#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 800#L18-3 assume !(0 == __VERIFIER_assert_~cond); 799#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 797#L28-2 assume !(main_~j~0 < 8); 796#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 789#L27-3 [2020-11-30 00:10:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-11-30 00:10:30,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:30,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549305638] [2020-11-30 00:10:30,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:30,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:30,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:30,729 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 836766457, now seen corresponding path program 7 times [2020-11-30 00:10:30,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:30,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955729119] [2020-11-30 00:10:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:30,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955729119] [2020-11-30 00:10:30,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628757584] [2020-11-30 00:10:30,867 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:10:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:30,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:10:30,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:30,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:10:30,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-11-30 00:10:30,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697916880] [2020-11-30 00:10:30,953 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:10:30,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:10:30,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:10:30,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:10:30,955 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-11-30 00:10:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:10:31,009 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-11-30 00:10:31,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:10:31,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2020-11-30 00:10:31,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-11-30 00:10:31,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2020-11-30 00:10:31,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-11-30 00:10:31,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-11-30 00:10:31,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2020-11-30 00:10:31,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:10:31,012 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-11-30 00:10:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2020-11-30 00:10:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-30 00:10:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-30 00:10:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-11-30 00:10:31,017 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-11-30 00:10:31,017 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-11-30 00:10:31,017 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 00:10:31,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 46 transitions. [2020-11-30 00:10:31,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-11-30 00:10:31,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:31,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:31,020 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:10:31,020 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 1, 1, 1] [2020-11-30 00:10:31,020 INFO L794 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 997#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 998#L27-3 [2020-11-30 00:10:31,020 INFO L796 eck$LassoCheckResult]: Loop: 998#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1004#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1039#L18 assume !(0 == __VERIFIER_assert_~cond); 1038#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1037#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1003#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 999#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1000#L18 assume !(0 == __VERIFIER_assert_~cond); 1001#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 995#L18-3 assume !(0 == __VERIFIER_assert_~cond); 996#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1036#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1035#L18 assume !(0 == __VERIFIER_assert_~cond); 1034#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1033#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1032#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1031#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1030#L18 assume !(0 == __VERIFIER_assert_~cond); 1029#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1028#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1027#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1026#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1025#L18 assume !(0 == __VERIFIER_assert_~cond); 1024#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1023#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1022#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1021#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1020#L18 assume !(0 == __VERIFIER_assert_~cond); 1019#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1018#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1017#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1016#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1015#L18 assume !(0 == __VERIFIER_assert_~cond); 1014#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1013#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1012#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1011#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1007#L18 assume !(0 == __VERIFIER_assert_~cond); 1010#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1009#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1008#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1006#L28-2 assume !(main_~j~0 < 8); 1005#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 998#L27-3 [2020-11-30 00:10:31,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:31,021 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-11-30 00:10:31,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:31,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607235040] [2020-11-30 00:10:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:31,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:31,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:31,036 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash -190546542, now seen corresponding path program 8 times [2020-11-30 00:10:31,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:31,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817947500] [2020-11-30 00:10:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:31,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:31,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:31,093 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1896379536, now seen corresponding path program 1 times [2020-11-30 00:10:31,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:31,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986139274] [2020-11-30 00:10:31,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:31,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:31,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:31,157 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:31,932 WARN L193 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 107 [2020-11-30 00:10:31,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-30 00:10:31,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:10:32,058 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:10:32,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:10:32,059 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:10:32,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:10:32,059 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:10:32,059 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:32,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:10:32,059 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:10:32,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration9_Loop [2020-11-30 00:10:32,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:10:32,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:10:32,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,240 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:10:32,241 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:32,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:32,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:10:32,265 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:10:32,265 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:32,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:32,317 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:32,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:10:32,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:10:32,429 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:10:32,432 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:10:32,432 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:10:32,432 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:10:32,432 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:10:32,432 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:10:32,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:32,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:10:32,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:10:32,433 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration9_Loop [2020-11-30 00:10:32,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:10:32,433 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:10:32,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:32,783 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:10:32,789 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/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-30 00:10:32,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:32,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:32,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:32,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:32,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:32,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:32,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:32,805 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-30 00:10:32,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:32,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:32,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:32,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:32,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:32,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:32,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:32,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:32,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:32,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:32,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:32,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:32,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:32,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:32,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:32,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:32,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:32,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:10:32,941 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:10:32,950 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-11-30 00:10:32,950 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:32,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:10:32,967 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:10:32,967 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:10:32,968 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nlen~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nlen~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,006 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:10:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:33,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:10:33,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:33,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:10:33,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2020-11-30 00:10:33,197 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:10:33,198 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-11-30 00:10:33,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 88 states and 91 transitions. Complement of second has 4 states. [2020-11-30 00:10:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:10:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:10:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-11-30 00:10:33,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 43 letters. [2020-11-30 00:10:33,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:33,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 45 letters. Loop has 43 letters. [2020-11-30 00:10:33,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:33,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 86 letters. [2020-11-30 00:10:33,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:33,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 91 transitions. [2020-11-30 00:10:33,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:10:33,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 90 transitions. [2020-11-30 00:10:33,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2020-11-30 00:10:33,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-11-30 00:10:33,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 90 transitions. [2020-11-30 00:10:33,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:10:33,271 INFO L691 BuchiCegarLoop]: Abstraction has 87 states and 90 transitions. [2020-11-30 00:10:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 90 transitions. [2020-11-30 00:10:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2020-11-30 00:10:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-30 00:10:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-11-30 00:10:33,281 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-11-30 00:10:33,281 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-11-30 00:10:33,281 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-30 00:10:33,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 54 transitions. [2020-11-30 00:10:33,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:10:33,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:33,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:33,284 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 00:10:33,285 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:10:33,285 INFO L794 eck$LassoCheckResult]: Stem: 1293#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1283#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1284#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1289#L28-2 [2020-11-30 00:10:33,285 INFO L796 eck$LassoCheckResult]: Loop: 1289#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1290#L18 assume !(0 == __VERIFIER_assert_~cond); 1294#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1285#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1286#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1289#L28-2 [2020-11-30 00:10:33,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:33,286 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2020-11-30 00:10:33,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:33,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640998186] [2020-11-30 00:10:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:33,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:33,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:33,313 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash 46241048, now seen corresponding path program 1 times [2020-11-30 00:10:33,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:33,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146156643] [2020-11-30 00:10:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:33,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:33,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:33,325 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash 271456306, now seen corresponding path program 1 times [2020-11-30 00:10:33,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:33,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015129882] [2020-11-30 00:10:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:33,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:33,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:33,349 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:33,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-30 00:10:33,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:10:33,456 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:10:33,457 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:10:33,457 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:10:33,457 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:10:33,457 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:10:33,457 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,457 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:10:33,457 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:10:33,457 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration10_Loop [2020-11-30 00:10:33,458 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:10:33,458 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:10:33,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:33,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:33,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:33,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:33,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:10:33,567 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:33,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:33,580 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,585 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:10:33,585 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Honda state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:33,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:10:33,641 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:10:33,641 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:33,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:10:33,673 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:10:33,673 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:33,702 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:10:33,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:10:33,774 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:10:33,775 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:10:33,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:10:33,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:10:33,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:10:33,776 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:10:33,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,776 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:10:33,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:10:33,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration10_Loop [2020-11-30 00:10:33,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:10:33,776 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:10:33,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:33,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:33,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:33,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:33,890 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:10:33,891 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:33,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:33,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:33,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:33,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:33,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:33,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:33,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:33,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:33,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:33,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:33,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:33,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:33,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:33,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:33,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:33,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:10:33,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:34,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:34,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:34,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:34,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:34,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:34,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:34,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:34,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:34,032 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:10:34,036 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 00:10:34,036 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:34,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:10:34,046 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:10:34,046 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:10:34,046 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:34,089 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:10:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:34,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:10:34,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:34,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:10:34,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:34,162 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:10:34,162 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-30 00:10:34,188 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 138 states and 145 transitions. Complement of second has 7 states. [2020-11-30 00:10:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:10:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:10:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-11-30 00:10:34,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 5 letters. [2020-11-30 00:10:34,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:34,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2020-11-30 00:10:34,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:34,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 10 letters. [2020-11-30 00:10:34,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:34,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 145 transitions. [2020-11-30 00:10:34,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:10:34,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 94 states and 98 transitions. [2020-11-30 00:10:34,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-11-30 00:10:34,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-11-30 00:10:34,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2020-11-30 00:10:34,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:10:34,197 INFO L691 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2020-11-30 00:10:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2020-11-30 00:10:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 51. [2020-11-30 00:10:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-30 00:10:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-11-30 00:10:34,208 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-11-30 00:10:34,209 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-11-30 00:10:34,209 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-30 00:10:34,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2020-11-30 00:10:34,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:10:34,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:10:34,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:10:34,214 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 2, 1, 1, 1, 1] [2020-11-30 00:10:34,217 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:10:34,217 INFO L794 eck$LassoCheckResult]: Stem: 1532#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1524#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1525#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1534#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1570#L18 assume !(0 == __VERIFIER_assert_~cond); 1569#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1568#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1533#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1528#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1529#L18 assume !(0 == __VERIFIER_assert_~cond); 1531#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1522#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1523#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1567#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1566#L18 assume !(0 == __VERIFIER_assert_~cond); 1565#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1564#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1563#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1562#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1561#L18 assume !(0 == __VERIFIER_assert_~cond); 1560#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1559#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1558#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1557#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1556#L18 assume !(0 == __VERIFIER_assert_~cond); 1555#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1554#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1553#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1552#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1551#L18 assume !(0 == __VERIFIER_assert_~cond); 1550#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1549#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1548#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1547#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1546#L18 assume !(0 == __VERIFIER_assert_~cond); 1545#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1544#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1543#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1542#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1538#L18 assume !(0 == __VERIFIER_assert_~cond); 1541#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1540#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1539#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1537#L28-2 assume !(main_~j~0 < 8); 1536#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1535#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1526#L28-2 [2020-11-30 00:10:34,218 INFO L796 eck$LassoCheckResult]: Loop: 1526#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1527#L18 assume !(0 == __VERIFIER_assert_~cond); 1530#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1520#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1521#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1526#L28-2 [2020-11-30 00:10:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1341776518, now seen corresponding path program 2 times [2020-11-30 00:10:34,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:34,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782573566] [2020-11-30 00:10:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:34,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:34,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:34,296 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 46241048, now seen corresponding path program 2 times [2020-11-30 00:10:34,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:34,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378440521] [2020-11-30 00:10:34,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:34,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:34,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:34,319 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1317012673, now seen corresponding path program 3 times [2020-11-30 00:10:34,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:10:34,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399248150] [2020-11-30 00:10:34,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:10:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:34,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:10:34,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:10:34,387 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:10:34,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-30 00:10:34,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:10:34,477 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:10:34,477 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:10:34,477 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:10:34,477 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:10:34,478 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:10:34,478 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:34,478 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:10:34,478 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:10:34,478 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration11_Loop [2020-11-30 00:10:34,478 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:10:34,478 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:10:34,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:34,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:34,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:34,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:34,586 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:10:34,586 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:34,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:34,590 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:34,595 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:10:34,595 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:34,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:34,650 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:34,658 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:10:34,658 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:34,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:34,703 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:34,707 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:10:34,707 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Honda state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:34,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:10:34,754 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:34,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:10:34,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:10:34,832 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:10:34,833 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:10:34,833 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:10:34,833 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:10:34,833 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:10:34,833 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:10:34,833 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:34,833 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:10:34,834 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:10:34,834 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration11_Loop [2020-11-30 00:10:34,834 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:10:34,834 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:10:34,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:34,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:34,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:34,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:10:34,957 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:10:34,957 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:34,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:34,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:34,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:34,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:34,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:34,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:34,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:34,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:10:34,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:35,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:35,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:35,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:35,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:35,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:35,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:35,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:35,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:10:35,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:35,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:35,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:35,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:35,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:35,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:35,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:35,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:35,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:10:35,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:35,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:10:35,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:10:35,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:10:35,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:10:35,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:10:35,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:10:35,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:10:35,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:10:35,098 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:10:35,103 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 00:10:35,103 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06cd3934-3108-401a-9bc6-43c8f781b666/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:10:35,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:10:35,114 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:10:35,114 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:10:35,115 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:10:35,158 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:10:35,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:35,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:10:35,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:35,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:10:35,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:35,282 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:10:35,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-11-30 00:10:35,313 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 128 states and 133 transitions. Complement of second has 7 states. [2020-11-30 00:10:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:10:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:10:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-11-30 00:10:35,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2020-11-30 00:10:35,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:35,315 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:10:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:35,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:10:35,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:35,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:10:35,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:35,418 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:10:35,418 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-11-30 00:10:35,444 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 128 states and 133 transitions. Complement of second has 7 states. [2020-11-30 00:10:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:10:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:10:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-11-30 00:10:35,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2020-11-30 00:10:35,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:35,446 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:10:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:10:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:35,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:10:35,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:10:35,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:10:35,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:10:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:10:35,610 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:10:35,610 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-11-30 00:10:35,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 90 states and 94 transitions. Complement of second has 6 states. [2020-11-30 00:10:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:10:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:10:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-11-30 00:10:35,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 5 letters. [2020-11-30 00:10:35,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:35,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 51 letters. Loop has 5 letters. [2020-11-30 00:10:35,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:35,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 10 letters. [2020-11-30 00:10:35,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:10:35,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 94 transitions. [2020-11-30 00:10:35,642 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 00:10:35,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 0 states and 0 transitions. [2020-11-30 00:10:35,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-30 00:10:35,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-30 00:10:35,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-30 00:10:35,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:10:35,643 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:10:35,643 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:10:35,643 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:10:35,643 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-30 00:10:35,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:10:35,643 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 00:10:35,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-30 00:10:35,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 12:10:35 BoogieIcfgContainer [2020-11-30 00:10:35,648 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 00:10:35,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:10:35,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:10:35,649 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:10:35,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:10:28" (3/4) ... [2020-11-30 00:10:35,652 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 00:10:35,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:10:35,653 INFO L168 Benchmark]: Toolchain (without parser) took 8413.52 ms. Allocated memory was 98.6 MB in the beginning and 144.7 MB in the end (delta: 46.1 MB). Free memory was 64.7 MB in the beginning and 101.9 MB in the end (delta: -37.1 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:10:35,654 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 79.7 MB. Free memory was 50.4 MB in the beginning and 50.4 MB in the end (delta: 26.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:10:35,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.38 ms. Allocated memory is still 98.6 MB. Free memory was 64.7 MB in the beginning and 75.4 MB in the end (delta: -10.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:10:35,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.07 ms. Allocated memory is still 98.6 MB. Free memory was 75.4 MB in the beginning and 74.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:10:35,656 INFO L168 Benchmark]: Boogie Preprocessor took 51.19 ms. Allocated memory is still 98.6 MB. Free memory was 74.2 MB in the beginning and 73.3 MB in the end (delta: 959.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:10:35,656 INFO L168 Benchmark]: RCFGBuilder took 383.92 ms. Allocated memory is still 98.6 MB. Free memory was 72.8 MB in the beginning and 61.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:10:35,657 INFO L168 Benchmark]: BuchiAutomizer took 7568.21 ms. Allocated memory was 98.6 MB in the beginning and 144.7 MB in the end (delta: 46.1 MB). Free memory was 61.2 MB in the beginning and 101.9 MB in the end (delta: -40.6 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:10:35,657 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 144.7 MB. Free memory is still 101.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:10:35,660 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.35 ms. Allocated memory is still 79.7 MB. Free memory was 50.4 MB in the beginning and 50.4 MB in the end (delta: 26.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 353.38 ms. Allocated memory is still 98.6 MB. Free memory was 64.7 MB in the beginning and 75.4 MB in the end (delta: -10.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.07 ms. Allocated memory is still 98.6 MB. Free memory was 75.4 MB in the beginning and 74.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.19 ms. Allocated memory is still 98.6 MB. Free memory was 74.2 MB in the beginning and 73.3 MB in the end (delta: 959.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 383.92 ms. Allocated memory is still 98.6 MB. Free memory was 72.8 MB in the beginning and 61.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 7568.21 ms. Allocated memory was 98.6 MB in the beginning and 144.7 MB in the end (delta: 46.1 MB). Free memory was 61.2 MB in the beginning and 101.9 MB in the end (delta: -40.6 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Witness Printer took 3.55 ms. Allocated memory is still 144.7 MB. Free memory is still 101.9 MB. There was no memory consumed. 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 (8 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function nlen + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -2 * j + 15 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 15 and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 5.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 107 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 51 states and ocurred in iteration 9. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 148/148 HoareTripleCheckerStatistics: 117 SDtfs, 199 SDslu, 195 SDs, 0 SdLazy, 187 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf98 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq135 hnf94 smp100 dnf100 smp100 tf112 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...