./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --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_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/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 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 20:52:14,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:52:14,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:52:15,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:52:15,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:52:15,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:52:15,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:52:15,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:52:15,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:52:15,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:52:15,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:52:15,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:52:15,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:52:15,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:52:15,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:52:15,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:52:15,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:52:15,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:52:15,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:52:15,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:52:15,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:52:15,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:52:15,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:52:15,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:52:15,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:52:15,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:52:15,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:52:15,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:52:15,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:52:15,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:52:15,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:52:15,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:52:15,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:52:15,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:52:15,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:52:15,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:52:15,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:52:15,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:52:15,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:52:15,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:52:15,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:52:15,115 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 20:52:15,141 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:52:15,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:52:15,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:52:15,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:52:15,143 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:52:15,144 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 20:52:15,144 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 20:52:15,144 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 20:52:15,145 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 20:52:15,145 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 20:52:15,145 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 20:52:15,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:52:15,146 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:52:15,146 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 20:52:15,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:52:15,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:52:15,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:52:15,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 20:52:15,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 20:52:15,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 20:52:15,148 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:52:15,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:52:15,148 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 20:52:15,148 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:52:15,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 20:52:15,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:52:15,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:52:15,150 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 20:52:15,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:52:15,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:52:15,150 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:52:15,151 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 20:52:15,152 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 20:52:15,152 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_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/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_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/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 -> 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 [2020-11-29 20:52:15,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:52:15,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:52:15,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:52:15,482 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:52:15,483 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:52:15,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_13.c [2020-11-29 20:52:15,581 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/data/94527fee1/bf3731e6345b479eba70130d89ffd930/FLAG61359994b [2020-11-29 20:52:16,296 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:52:16,296 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/sv-benchmarks/c/locks/test_locks_13.c [2020-11-29 20:52:16,310 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/data/94527fee1/bf3731e6345b479eba70130d89ffd930/FLAG61359994b [2020-11-29 20:52:16,633 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/data/94527fee1/bf3731e6345b479eba70130d89ffd930 [2020-11-29 20:52:16,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:52:16,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:52:16,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:52:16,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:52:16,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:52:16,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:52:16" (1/1) ... [2020-11-29 20:52:16,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb1e2e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:16, skipping insertion in model container [2020-11-29 20:52:16,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:52:16" (1/1) ... [2020-11-29 20:52:16,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:52:16,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:52:16,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:52:16,959 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:52:16,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:52:17,011 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:52:17,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17 WrapperNode [2020-11-29 20:52:17,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:52:17,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:52:17,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:52:17,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:52:17,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... [2020-11-29 20:52:17,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... [2020-11-29 20:52:17,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:52:17,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:52:17,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:52:17,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:52:17,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... [2020-11-29 20:52:17,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... [2020-11-29 20:52:17,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... [2020-11-29 20:52:17,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... [2020-11-29 20:52:17,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... [2020-11-29 20:52:17,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... [2020-11-29 20:52:17,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... [2020-11-29 20:52:17,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:52:17,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:52:17,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:52:17,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:52:17,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/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-29 20:52:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:52:17,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:52:17,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:52:17,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:52:17,694 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:52:17,694 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-29 20:52:17,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:52:17 BoogieIcfgContainer [2020-11-29 20:52:17,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:52:17,698 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 20:52:17,698 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 20:52:17,703 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 20:52:17,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 20:52:17,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 08:52:16" (1/3) ... [2020-11-29 20:52:17,706 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4496aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 08:52:17, skipping insertion in model container [2020-11-29 20:52:17,706 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 20:52:17,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:52:17" (2/3) ... [2020-11-29 20:52:17,707 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4496aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 08:52:17, skipping insertion in model container [2020-11-29 20:52:17,707 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 20:52:17,707 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:52:17" (3/3) ... [2020-11-29 20:52:17,709 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2020-11-29 20:52:17,766 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 20:52:17,766 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 20:52:17,766 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 20:52:17,766 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:52:17,767 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:52:17,767 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 20:52:17,767 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:52:17,767 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 20:52:17,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-11-29 20:52:17,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2020-11-29 20:52:17,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:17,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:17,822 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:17,822 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:17,822 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 20:52:17,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-11-29 20:52:17,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2020-11-29 20:52:17,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:17,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:17,830 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:17,831 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:17,840 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 18#L197-1true [2020-11-29 20:52:17,842 INFO L796 eck$LassoCheckResult]: Loop: 18#L197-1true assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 26#L52true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 45#L83true assume 0 != main_~p1~0;main_~lk1~0 := 1; 43#L83-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 10#L87-1true assume !(0 != main_~p3~0); 3#L91-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 6#L95-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 30#L99-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 22#L103-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 36#L107-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 40#L111-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 33#L115-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 49#L119-1true assume !(0 != main_~p11~0); 41#L123-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 46#L127-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 13#L131-1true assume !(0 != main_~p1~0); 34#L137-1true assume !(0 != main_~p2~0); 14#L142-1true assume !(0 != main_~p3~0); 24#L147-1true assume !(0 != main_~p4~0); 50#L152-1true assume !(0 != main_~p5~0); 4#L157-1true assume !(0 != main_~p6~0); 37#L162-1true assume !(0 != main_~p7~0); 42#L167-1true assume !(0 != main_~p8~0); 28#L172-1true assume !(0 != main_~p9~0); 31#L177-1true assume !(0 != main_~p10~0); 9#L182-1true assume !(0 != main_~p11~0); 20#L187-1true assume !(0 != main_~p12~0); 47#L192-1true assume !(0 != main_~p13~0); 18#L197-1true [2020-11-29 20:52:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 20:52:17,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:17,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487834320] [2020-11-29 20:52:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:18,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:18,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:18,103 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2020-11-29 20:52:18,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:18,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389337191] [2020-11-29 20:52:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:18,222 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-29 20:52:18,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389337191] [2020-11-29 20:52:18,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:18,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:18,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389663337] [2020-11-29 20:52:18,240 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:18,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:18,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:18,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:18,268 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-11-29 20:52:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:18,342 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2020-11-29 20:52:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:18,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2020-11-29 20:52:18,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2020-11-29 20:52:18,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2020-11-29 20:52:18,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2020-11-29 20:52:18,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2020-11-29 20:52:18,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2020-11-29 20:52:18,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:18,366 INFO L691 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-11-29 20:52:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2020-11-29 20:52:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-11-29 20:52:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-29 20:52:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2020-11-29 20:52:18,404 INFO L714 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-11-29 20:52:18,404 INFO L594 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-11-29 20:52:18,405 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 20:52:18,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2020-11-29 20:52:18,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2020-11-29 20:52:18,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:18,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:18,410 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:18,410 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:18,411 INFO L794 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 171#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 172#L197-1 [2020-11-29 20:52:18,411 INFO L796 eck$LassoCheckResult]: Loop: 172#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 199#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 200#L83 assume !(0 != main_~p1~0); 193#L83-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 178#L87-1 assume !(0 != main_~p3~0); 151#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 152#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 168#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 230#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 229#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 228#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 227#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 226#L119-1 assume !(0 != main_~p11~0); 225#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 224#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 223#L131-1 assume !(0 != main_~p1~0); 163#L137-1 assume !(0 != main_~p2~0); 164#L142-1 assume !(0 != main_~p3~0); 195#L147-1 assume !(0 != main_~p4~0); 186#L152-1 assume !(0 != main_~p5~0); 158#L157-1 assume !(0 != main_~p6~0); 160#L162-1 assume !(0 != main_~p7~0); 167#L167-1 assume !(0 != main_~p8~0); 184#L172-1 assume !(0 != main_~p9~0); 210#L177-1 assume !(0 != main_~p10~0); 177#L182-1 assume !(0 != main_~p11~0); 157#L187-1 assume !(0 != main_~p12~0); 180#L192-1 assume !(0 != main_~p13~0); 172#L197-1 [2020-11-29 20:52:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-29 20:52:18,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:18,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201867427] [2020-11-29 20:52:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:18,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:18,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:18,457 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:18,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2020-11-29 20:52:18,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:18,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932923552] [2020-11-29 20:52:18,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:18,507 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-29 20:52:18,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932923552] [2020-11-29 20:52:18,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:18,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:18,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737192171] [2020-11-29 20:52:18,509 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:18,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:18,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:18,511 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand 3 states. [2020-11-29 20:52:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:18,551 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2020-11-29 20:52:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:18,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2020-11-29 20:52:18,559 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2020-11-29 20:52:18,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2020-11-29 20:52:18,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2020-11-29 20:52:18,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2020-11-29 20:52:18,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2020-11-29 20:52:18,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:18,571 INFO L691 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2020-11-29 20:52:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2020-11-29 20:52:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-11-29 20:52:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-29 20:52:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2020-11-29 20:52:18,598 INFO L714 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2020-11-29 20:52:18,599 INFO L594 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2020-11-29 20:52:18,599 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 20:52:18,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2020-11-29 20:52:18,608 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2020-11-29 20:52:18,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:18,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:18,613 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:18,614 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:18,614 INFO L794 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 421#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 422#L197-1 [2020-11-29 20:52:18,615 INFO L796 eck$LassoCheckResult]: Loop: 422#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 473#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 471#L83 assume !(0 != main_~p1~0); 469#L83-2 assume !(0 != main_~p2~0); 467#L87-1 assume !(0 != main_~p3~0); 466#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 465#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 464#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 463#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 462#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 461#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 460#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 459#L119-1 assume !(0 != main_~p11~0); 458#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 457#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 454#L131-1 assume !(0 != main_~p1~0); 455#L137-1 assume !(0 != main_~p2~0); 500#L142-1 assume !(0 != main_~p3~0); 497#L147-1 assume !(0 != main_~p4~0); 494#L152-1 assume !(0 != main_~p5~0); 491#L157-1 assume !(0 != main_~p6~0); 488#L162-1 assume !(0 != main_~p7~0); 486#L167-1 assume !(0 != main_~p8~0); 483#L172-1 assume !(0 != main_~p9~0); 481#L177-1 assume !(0 != main_~p10~0); 479#L182-1 assume !(0 != main_~p11~0); 476#L187-1 assume !(0 != main_~p12~0); 475#L192-1 assume !(0 != main_~p13~0); 422#L197-1 [2020-11-29 20:52:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-29 20:52:18,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:18,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136126750] [2020-11-29 20:52:18,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:18,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:18,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:18,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:18,692 INFO L82 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2020-11-29 20:52:18,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:18,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423238915] [2020-11-29 20:52:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:18,768 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-29 20:52:18,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423238915] [2020-11-29 20:52:18,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:18,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:18,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825741597] [2020-11-29 20:52:18,770 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:18,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:18,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:18,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:18,771 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand 3 states. [2020-11-29 20:52:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:18,858 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2020-11-29 20:52:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:18,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2020-11-29 20:52:18,865 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2020-11-29 20:52:18,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2020-11-29 20:52:18,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2020-11-29 20:52:18,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2020-11-29 20:52:18,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2020-11-29 20:52:18,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:18,884 INFO L691 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2020-11-29 20:52:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2020-11-29 20:52:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2020-11-29 20:52:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2020-11-29 20:52:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2020-11-29 20:52:18,935 INFO L714 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2020-11-29 20:52:18,935 INFO L594 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2020-11-29 20:52:18,935 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 20:52:18,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2020-11-29 20:52:18,939 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2020-11-29 20:52:18,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:18,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:18,940 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:18,940 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:18,940 INFO L794 eck$LassoCheckResult]: Stem: 943#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 908#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 909#L197-1 [2020-11-29 20:52:18,940 INFO L796 eck$LassoCheckResult]: Loop: 909#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 987#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 984#L83 assume !(0 != main_~p1~0); 980#L83-2 assume !(0 != main_~p2~0); 977#L87-1 assume !(0 != main_~p3~0); 975#L91-1 assume !(0 != main_~p4~0); 971#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 972#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 967#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 968#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 963#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 964#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 959#L119-1 assume !(0 != main_~p11~0); 960#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 955#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 956#L131-1 assume !(0 != main_~p1~0); 1032#L137-1 assume !(0 != main_~p2~0); 1029#L142-1 assume !(0 != main_~p3~0); 1026#L147-1 assume !(0 != main_~p4~0); 1024#L152-1 assume !(0 != main_~p5~0); 1020#L157-1 assume !(0 != main_~p6~0); 1016#L162-1 assume !(0 != main_~p7~0); 1012#L167-1 assume !(0 != main_~p8~0); 1007#L172-1 assume !(0 != main_~p9~0); 1004#L177-1 assume !(0 != main_~p10~0); 1000#L182-1 assume !(0 != main_~p11~0); 995#L187-1 assume !(0 != main_~p12~0); 992#L192-1 assume !(0 != main_~p13~0); 909#L197-1 [2020-11-29 20:52:18,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:18,941 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-29 20:52:18,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:18,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681125458] [2020-11-29 20:52:18,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:18,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:18,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:19,001 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2020-11-29 20:52:19,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:19,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533840607] [2020-11-29 20:52:19,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,094 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-29 20:52:19,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533840607] [2020-11-29 20:52:19,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:19,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:19,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804358589] [2020-11-29 20:52:19,096 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:19,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:19,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:19,097 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand 3 states. [2020-11-29 20:52:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:19,137 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2020-11-29 20:52:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:19,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2020-11-29 20:52:19,147 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2020-11-29 20:52:19,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2020-11-29 20:52:19,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2020-11-29 20:52:19,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2020-11-29 20:52:19,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2020-11-29 20:52:19,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:19,158 INFO L691 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2020-11-29 20:52:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2020-11-29 20:52:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2020-11-29 20:52:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2020-11-29 20:52:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2020-11-29 20:52:19,182 INFO L714 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2020-11-29 20:52:19,182 INFO L594 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2020-11-29 20:52:19,182 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 20:52:19,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2020-11-29 20:52:19,188 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2020-11-29 20:52:19,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:19,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:19,189 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:19,190 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:19,190 INFO L794 eck$LassoCheckResult]: Stem: 1885#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1858#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 1859#L197-1 [2020-11-29 20:52:19,190 INFO L796 eck$LassoCheckResult]: Loop: 1859#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 1939#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 1934#L83 assume !(0 != main_~p1~0); 1926#L83-2 assume !(0 != main_~p2~0); 1919#L87-1 assume !(0 != main_~p3~0); 1914#L91-1 assume !(0 != main_~p4~0); 1915#L95-1 assume !(0 != main_~p5~0); 2055#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2053#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2050#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2048#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2042#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2040#L119-1 assume !(0 != main_~p11~0); 2034#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2030#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2027#L131-1 assume !(0 != main_~p1~0); 2022#L137-1 assume !(0 != main_~p2~0); 2017#L142-1 assume !(0 != main_~p3~0); 2010#L147-1 assume !(0 != main_~p4~0); 2005#L152-1 assume !(0 != main_~p5~0); 2002#L157-1 assume !(0 != main_~p6~0); 1998#L162-1 assume !(0 != main_~p7~0); 1996#L167-1 assume !(0 != main_~p8~0); 1992#L172-1 assume !(0 != main_~p9~0); 1990#L177-1 assume !(0 != main_~p10~0); 1976#L182-1 assume !(0 != main_~p11~0); 1963#L187-1 assume !(0 != main_~p12~0); 1950#L192-1 assume !(0 != main_~p13~0); 1859#L197-1 [2020-11-29 20:52:19,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-11-29 20:52:19,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:19,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138280498] [2020-11-29 20:52:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:19,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:19,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:19,221 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2020-11-29 20:52:19,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:19,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533687557] [2020-11-29 20:52:19,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,257 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-29 20:52:19,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533687557] [2020-11-29 20:52:19,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:19,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:19,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182223605] [2020-11-29 20:52:19,259 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:19,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:19,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:19,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:19,260 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand 3 states. [2020-11-29 20:52:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:19,286 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2020-11-29 20:52:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:19,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2020-11-29 20:52:19,302 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2020-11-29 20:52:19,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2020-11-29 20:52:19,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2020-11-29 20:52:19,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2020-11-29 20:52:19,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2020-11-29 20:52:19,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:19,322 INFO L691 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2020-11-29 20:52:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2020-11-29 20:52:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2020-11-29 20:52:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1234 states. [2020-11-29 20:52:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2020-11-29 20:52:19,356 INFO L714 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2020-11-29 20:52:19,356 INFO L594 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2020-11-29 20:52:19,357 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 20:52:19,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2020-11-29 20:52:19,367 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2020-11-29 20:52:19,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:19,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:19,368 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:19,368 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:19,368 INFO L794 eck$LassoCheckResult]: Stem: 3755#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3722#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 3723#L197-1 [2020-11-29 20:52:19,369 INFO L796 eck$LassoCheckResult]: Loop: 3723#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 3848#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 3845#L83 assume !(0 != main_~p1~0); 3841#L83-2 assume !(0 != main_~p2~0); 3838#L87-1 assume !(0 != main_~p3~0); 3803#L91-1 assume !(0 != main_~p4~0); 3804#L95-1 assume !(0 != main_~p5~0); 4061#L99-1 assume !(0 != main_~p6~0); 4062#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4038#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4033#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4021#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4019#L119-1 assume !(0 != main_~p11~0); 4012#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4006#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4000#L131-1 assume !(0 != main_~p1~0); 3994#L137-1 assume !(0 != main_~p2~0); 3973#L142-1 assume !(0 != main_~p3~0); 3968#L147-1 assume !(0 != main_~p4~0); 3966#L152-1 assume !(0 != main_~p5~0); 3962#L157-1 assume !(0 != main_~p6~0); 3959#L162-1 assume !(0 != main_~p7~0); 3930#L167-1 assume !(0 != main_~p8~0); 3925#L172-1 assume !(0 != main_~p9~0); 3923#L177-1 assume !(0 != main_~p10~0); 3920#L182-1 assume !(0 != main_~p11~0); 3915#L187-1 assume !(0 != main_~p12~0); 3853#L192-1 assume !(0 != main_~p13~0); 3723#L197-1 [2020-11-29 20:52:19,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:19,369 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-11-29 20:52:19,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:19,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983885728] [2020-11-29 20:52:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:19,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:19,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:19,393 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:19,394 INFO L82 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2020-11-29 20:52:19,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:19,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531773540] [2020-11-29 20:52:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,423 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-29 20:52:19,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531773540] [2020-11-29 20:52:19,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:19,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:19,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250477006] [2020-11-29 20:52:19,425 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:19,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:19,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:19,426 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand 3 states. [2020-11-29 20:52:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:19,472 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2020-11-29 20:52:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:19,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2020-11-29 20:52:19,521 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2020-11-29 20:52:19,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2020-11-29 20:52:19,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2020-11-29 20:52:19,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2020-11-29 20:52:19,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2020-11-29 20:52:19,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:19,555 INFO L691 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2020-11-29 20:52:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2020-11-29 20:52:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2020-11-29 20:52:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2020-11-29 20:52:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2020-11-29 20:52:19,651 INFO L714 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2020-11-29 20:52:19,652 INFO L594 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2020-11-29 20:52:19,652 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 20:52:19,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2020-11-29 20:52:19,672 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2020-11-29 20:52:19,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:19,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:19,674 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:19,675 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:19,675 INFO L794 eck$LassoCheckResult]: Stem: 7432#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7397#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 7398#L197-1 [2020-11-29 20:52:19,676 INFO L796 eck$LassoCheckResult]: Loop: 7398#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 7880#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 7876#L83 assume !(0 != main_~p1~0); 7874#L83-2 assume !(0 != main_~p2~0); 7609#L87-1 assume !(0 != main_~p3~0); 7610#L91-1 assume !(0 != main_~p4~0); 7592#L95-1 assume !(0 != main_~p5~0); 7582#L99-1 assume !(0 != main_~p6~0); 7572#L103-1 assume !(0 != main_~p7~0); 7565#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 7559#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 7553#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 7547#L119-1 assume !(0 != main_~p11~0); 7540#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 7541#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 7841#L131-1 assume !(0 != main_~p1~0); 7839#L137-1 assume !(0 != main_~p2~0); 7823#L142-1 assume !(0 != main_~p3~0); 7812#L147-1 assume !(0 != main_~p4~0); 7801#L152-1 assume !(0 != main_~p5~0); 7802#L157-1 assume !(0 != main_~p6~0); 7919#L162-1 assume !(0 != main_~p7~0); 7916#L167-1 assume !(0 != main_~p8~0); 7911#L172-1 assume !(0 != main_~p9~0); 7908#L177-1 assume !(0 != main_~p10~0); 7906#L182-1 assume !(0 != main_~p11~0); 7890#L187-1 assume !(0 != main_~p12~0); 7884#L192-1 assume !(0 != main_~p13~0); 7398#L197-1 [2020-11-29 20:52:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-11-29 20:52:19,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:19,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475444454] [2020-11-29 20:52:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:19,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:19,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:19,711 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2020-11-29 20:52:19,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:19,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645539859] [2020-11-29 20:52:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:19,737 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-29 20:52:19,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645539859] [2020-11-29 20:52:19,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:19,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:19,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061414599] [2020-11-29 20:52:19,738 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:19,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:19,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:19,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:19,739 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2020-11-29 20:52:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:19,805 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2020-11-29 20:52:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:19,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2020-11-29 20:52:19,867 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2020-11-29 20:52:19,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2020-11-29 20:52:19,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2020-11-29 20:52:19,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2020-11-29 20:52:19,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2020-11-29 20:52:19,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:19,938 INFO L691 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2020-11-29 20:52:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2020-11-29 20:52:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2020-11-29 20:52:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4802 states. [2020-11-29 20:52:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2020-11-29 20:52:20,084 INFO L714 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2020-11-29 20:52:20,084 INFO L594 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2020-11-29 20:52:20,084 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 20:52:20,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2020-11-29 20:52:20,166 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2020-11-29 20:52:20,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:20,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:20,171 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:20,171 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:20,172 INFO L794 eck$LassoCheckResult]: Stem: 14675#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 14639#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 14640#L197-1 [2020-11-29 20:52:20,172 INFO L796 eck$LassoCheckResult]: Loop: 14640#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 14936#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 14932#L83 assume !(0 != main_~p1~0); 14929#L83-2 assume !(0 != main_~p2~0); 14930#L87-1 assume !(0 != main_~p3~0); 14868#L91-1 assume !(0 != main_~p4~0); 14869#L95-1 assume !(0 != main_~p5~0); 14849#L99-1 assume !(0 != main_~p6~0); 14851#L103-1 assume !(0 != main_~p7~0); 14825#L107-1 assume !(0 != main_~p8~0); 14827#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 14808#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 14809#L119-1 assume !(0 != main_~p11~0); 14792#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 14793#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 14773#L131-1 assume !(0 != main_~p1~0); 14775#L137-1 assume !(0 != main_~p2~0); 14976#L142-1 assume !(0 != main_~p3~0); 14972#L147-1 assume !(0 != main_~p4~0); 14970#L152-1 assume !(0 != main_~p5~0); 14967#L157-1 assume !(0 != main_~p6~0); 14963#L162-1 assume !(0 != main_~p7~0); 14959#L167-1 assume !(0 != main_~p8~0); 14955#L172-1 assume !(0 != main_~p9~0); 14952#L177-1 assume !(0 != main_~p10~0); 14948#L182-1 assume !(0 != main_~p11~0); 14943#L187-1 assume !(0 != main_~p12~0); 14940#L192-1 assume !(0 != main_~p13~0); 14640#L197-1 [2020-11-29 20:52:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:20,174 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-11-29 20:52:20,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:20,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609687792] [2020-11-29 20:52:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:20,196 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:20,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:20,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2020-11-29 20:52:20,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:20,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006737111] [2020-11-29 20:52:20,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:20,265 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-29 20:52:20,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006737111] [2020-11-29 20:52:20,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:20,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:20,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136271840] [2020-11-29 20:52:20,267 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:20,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:20,268 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2020-11-29 20:52:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:20,366 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2020-11-29 20:52:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:20,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2020-11-29 20:52:20,448 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2020-11-29 20:52:20,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2020-11-29 20:52:20,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2020-11-29 20:52:20,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2020-11-29 20:52:20,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2020-11-29 20:52:20,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:20,558 INFO L691 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2020-11-29 20:52:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2020-11-29 20:52:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2020-11-29 20:52:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9474 states. [2020-11-29 20:52:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2020-11-29 20:52:20,862 INFO L714 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2020-11-29 20:52:20,862 INFO L594 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2020-11-29 20:52:20,862 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 20:52:20,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2020-11-29 20:52:20,912 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2020-11-29 20:52:20,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:20,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:20,914 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:20,914 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:20,914 INFO L794 eck$LassoCheckResult]: Stem: 28951#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 28920#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 28921#L197-1 [2020-11-29 20:52:20,916 INFO L796 eck$LassoCheckResult]: Loop: 28921#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 29080#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29076#L83 assume !(0 != main_~p1~0); 29072#L83-2 assume !(0 != main_~p2~0); 29070#L87-1 assume !(0 != main_~p3~0); 29066#L91-1 assume !(0 != main_~p4~0); 29063#L95-1 assume !(0 != main_~p5~0); 29059#L99-1 assume !(0 != main_~p6~0); 29055#L103-1 assume !(0 != main_~p7~0); 29056#L107-1 assume !(0 != main_~p8~0); 29445#L111-1 assume !(0 != main_~p9~0); 29442#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 29439#L119-1 assume !(0 != main_~p11~0); 29435#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 29431#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 29426#L131-1 assume !(0 != main_~p1~0); 29421#L137-1 assume !(0 != main_~p2~0); 29352#L142-1 assume !(0 != main_~p3~0); 29347#L147-1 assume !(0 != main_~p4~0); 29343#L152-1 assume !(0 != main_~p5~0); 29339#L157-1 assume !(0 != main_~p6~0); 29337#L162-1 assume !(0 != main_~p7~0); 29336#L167-1 assume !(0 != main_~p8~0); 29335#L172-1 assume !(0 != main_~p9~0); 29334#L177-1 assume !(0 != main_~p10~0); 29330#L182-1 assume !(0 != main_~p11~0); 29088#L187-1 assume !(0 != main_~p12~0); 29085#L192-1 assume !(0 != main_~p13~0); 28921#L197-1 [2020-11-29 20:52:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:20,918 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-11-29 20:52:20,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:20,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503373909] [2020-11-29 20:52:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:20,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:20,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:20,959 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2020-11-29 20:52:20,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:20,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001980449] [2020-11-29 20:52:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:21,002 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-29 20:52:21,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001980449] [2020-11-29 20:52:21,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:21,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:21,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951360928] [2020-11-29 20:52:21,003 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:21,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:21,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:21,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:21,004 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2020-11-29 20:52:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:21,234 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2020-11-29 20:52:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:21,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2020-11-29 20:52:21,419 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2020-11-29 20:52:21,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2020-11-29 20:52:21,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2020-11-29 20:52:21,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2020-11-29 20:52:21,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2020-11-29 20:52:21,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:21,725 INFO L691 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2020-11-29 20:52:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2020-11-29 20:52:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2020-11-29 20:52:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18690 states. [2020-11-29 20:52:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2020-11-29 20:52:22,222 INFO L714 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2020-11-29 20:52:22,222 INFO L594 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2020-11-29 20:52:22,223 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 20:52:22,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2020-11-29 20:52:22,305 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2020-11-29 20:52:22,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:22,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:22,309 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:22,309 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:22,310 INFO L794 eck$LassoCheckResult]: Stem: 57131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 57089#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 57090#L197-1 [2020-11-29 20:52:22,310 INFO L796 eck$LassoCheckResult]: Loop: 57090#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 57231#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 57228#L83 assume !(0 != main_~p1~0); 57224#L83-2 assume !(0 != main_~p2~0); 57221#L87-1 assume !(0 != main_~p3~0); 57218#L91-1 assume !(0 != main_~p4~0); 57214#L95-1 assume !(0 != main_~p5~0); 57210#L99-1 assume !(0 != main_~p6~0); 57206#L103-1 assume !(0 != main_~p7~0); 57207#L107-1 assume !(0 != main_~p8~0); 57294#L111-1 assume !(0 != main_~p9~0); 57290#L115-1 assume !(0 != main_~p10~0); 57288#L119-1 assume !(0 != main_~p11~0); 57286#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 57284#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 57280#L131-1 assume !(0 != main_~p1~0); 57276#L137-1 assume !(0 != main_~p2~0); 57273#L142-1 assume !(0 != main_~p3~0); 57268#L147-1 assume !(0 != main_~p4~0); 57264#L152-1 assume !(0 != main_~p5~0); 57260#L157-1 assume !(0 != main_~p6~0); 57258#L162-1 assume !(0 != main_~p7~0); 57255#L167-1 assume !(0 != main_~p8~0); 57251#L172-1 assume !(0 != main_~p9~0); 57247#L177-1 assume !(0 != main_~p10~0); 57244#L182-1 assume !(0 != main_~p11~0); 57239#L187-1 assume !(0 != main_~p12~0); 57236#L192-1 assume !(0 != main_~p13~0); 57090#L197-1 [2020-11-29 20:52:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:22,311 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-11-29 20:52:22,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:22,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164309406] [2020-11-29 20:52:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:22,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:22,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:22,354 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2020-11-29 20:52:22,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:22,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944478791] [2020-11-29 20:52:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:22,394 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-29 20:52:22,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944478791] [2020-11-29 20:52:22,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:22,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:52:22,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321114789] [2020-11-29 20:52:22,395 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:22,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:22,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:22,396 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2020-11-29 20:52:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:22,718 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2020-11-29 20:52:22,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:22,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2020-11-29 20:52:23,125 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2020-11-29 20:52:23,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2020-11-29 20:52:23,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2020-11-29 20:52:23,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2020-11-29 20:52:23,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2020-11-29 20:52:23,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:23,484 INFO L691 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2020-11-29 20:52:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2020-11-29 20:52:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2020-11-29 20:52:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36866 states. [2020-11-29 20:52:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2020-11-29 20:52:24,699 INFO L714 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2020-11-29 20:52:24,699 INFO L594 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2020-11-29 20:52:24,699 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 20:52:24,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2020-11-29 20:52:25,010 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2020-11-29 20:52:25,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:25,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:25,011 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:25,011 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:25,011 INFO L794 eck$LassoCheckResult]: Stem: 112691#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 112652#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 112653#L197-1 [2020-11-29 20:52:25,012 INFO L796 eck$LassoCheckResult]: Loop: 112653#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 113254#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 113253#L83 assume !(0 != main_~p1~0); 113251#L83-2 assume !(0 != main_~p2~0); 113250#L87-1 assume !(0 != main_~p3~0); 113248#L91-1 assume !(0 != main_~p4~0); 113246#L95-1 assume !(0 != main_~p5~0); 113244#L99-1 assume !(0 != main_~p6~0); 113242#L103-1 assume !(0 != main_~p7~0); 113241#L107-1 assume !(0 != main_~p8~0); 113238#L111-1 assume !(0 != main_~p9~0); 113225#L115-1 assume !(0 != main_~p10~0); 113226#L119-1 assume !(0 != main_~p11~0); 113319#L123-1 assume !(0 != main_~p12~0); 113318#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 113315#L131-1 assume !(0 != main_~p1~0); 113307#L137-1 assume !(0 != main_~p2~0); 113301#L142-1 assume !(0 != main_~p3~0); 113297#L147-1 assume !(0 != main_~p4~0); 113289#L152-1 assume !(0 != main_~p5~0); 113286#L157-1 assume !(0 != main_~p6~0); 113266#L162-1 assume !(0 != main_~p7~0); 113264#L167-1 assume !(0 != main_~p8~0); 113260#L172-1 assume !(0 != main_~p9~0); 113013#L177-1 assume !(0 != main_~p10~0); 113014#L182-1 assume !(0 != main_~p11~0); 113174#L187-1 assume !(0 != main_~p12~0); 113256#L192-1 assume !(0 != main_~p13~0); 112653#L197-1 [2020-11-29 20:52:25,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:25,012 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-11-29 20:52:25,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:25,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021336697] [2020-11-29 20:52:25,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:25,035 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:25,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:25,051 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:25,052 INFO L82 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2020-11-29 20:52:25,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:25,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324870136] [2020-11-29 20:52:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:52:25,085 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-29 20:52:25,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324870136] [2020-11-29 20:52:25,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:52:25,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:52:25,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910371858] [2020-11-29 20:52:25,087 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 20:52:25,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:52:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:52:25,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:52:25,087 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand 3 states. [2020-11-29 20:52:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:52:25,513 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2020-11-29 20:52:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:52:25,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2020-11-29 20:52:26,217 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2020-11-29 20:52:26,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2020-11-29 20:52:26,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2020-11-29 20:52:26,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2020-11-29 20:52:26,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2020-11-29 20:52:26,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:52:26,850 INFO L691 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2020-11-29 20:52:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2020-11-29 20:52:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2020-11-29 20:52:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72706 states. [2020-11-29 20:52:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2020-11-29 20:52:28,143 INFO L714 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2020-11-29 20:52:28,143 INFO L594 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2020-11-29 20:52:28,143 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 20:52:28,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2020-11-29 20:52:28,338 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2020-11-29 20:52:28,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:52:28,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:52:28,339 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 20:52:28,339 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:52:28,340 INFO L794 eck$LassoCheckResult]: Stem: 222266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 222229#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 222230#L197-1 [2020-11-29 20:52:28,340 INFO L796 eck$LassoCheckResult]: Loop: 222230#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 222827#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 222825#L83 assume !(0 != main_~p1~0); 222823#L83-2 assume !(0 != main_~p2~0); 222702#L87-1 assume !(0 != main_~p3~0); 222695#L91-1 assume !(0 != main_~p4~0); 222686#L95-1 assume !(0 != main_~p5~0); 222688#L99-1 assume !(0 != main_~p6~0); 222801#L103-1 assume !(0 != main_~p7~0); 222797#L107-1 assume !(0 != main_~p8~0); 222793#L111-1 assume !(0 != main_~p9~0); 222789#L115-1 assume !(0 != main_~p10~0); 222787#L119-1 assume !(0 != main_~p11~0); 222783#L123-1 assume !(0 != main_~p12~0); 222779#L127-1 assume !(0 != main_~p13~0); 222777#L131-1 assume !(0 != main_~p1~0); 222775#L137-1 assume !(0 != main_~p2~0); 222774#L142-1 assume !(0 != main_~p3~0); 222771#L147-1 assume !(0 != main_~p4~0); 222769#L152-1 assume !(0 != main_~p5~0); 222767#L157-1 assume !(0 != main_~p6~0); 222765#L162-1 assume !(0 != main_~p7~0); 222763#L167-1 assume !(0 != main_~p8~0); 222761#L172-1 assume !(0 != main_~p9~0); 222759#L177-1 assume !(0 != main_~p10~0); 222758#L182-1 assume !(0 != main_~p11~0); 222740#L187-1 assume !(0 != main_~p12~0); 222741#L192-1 assume !(0 != main_~p13~0); 222230#L197-1 [2020-11-29 20:52:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2020-11-29 20:52:28,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:28,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851971868] [2020-11-29 20:52:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:28,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:28,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:28,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2020-11-29 20:52:28,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:28,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956755904] [2020-11-29 20:52:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:28,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:28,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:28,416 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:52:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2020-11-29 20:52:28,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:52:28,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476918965] [2020-11-29 20:52:28,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:52:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:28,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:52:28,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:52:28,440 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:52:28,899 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-11-29 20:52:29,023 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-11-29 20:52:29,396 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2020-11-29 20:52:29,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 08:52:29 BoogieIcfgContainer [2020-11-29 20:52:29,561 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 20:52:29,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:52:29,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:52:29,562 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:52:29,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:52:17" (3/4) ... [2020-11-29 20:52:29,566 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-29 20:52:29,632 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bd7395ef-4aeb-4baa-b3cb-574bd4c3a9a0/bin/uautomizer/witness.graphml [2020-11-29 20:52:29,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:52:29,634 INFO L168 Benchmark]: Toolchain (without parser) took 12994.67 ms. Allocated memory was 146.8 MB in the beginning and 4.6 GB in the end (delta: 4.5 GB). Free memory was 121.0 MB in the beginning and 4.0 GB in the end (delta: -3.9 GB). Peak memory consumption was 542.7 MB. Max. memory is 16.1 GB. [2020-11-29 20:52:29,634 INFO L168 Benchmark]: CDTParser took 1.01 ms. Allocated memory is still 94.4 MB. Free memory is still 52.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:52:29,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.78 ms. Allocated memory is still 146.8 MB. Free memory was 121.0 MB in the beginning and 123.8 MB in the end (delta: -2.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:52:29,635 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.50 ms. Allocated memory is still 146.8 MB. Free memory was 123.8 MB in the beginning and 121.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:52:29,636 INFO L168 Benchmark]: Boogie Preprocessor took 31.82 ms. Allocated memory is still 146.8 MB. Free memory was 121.7 MB in the beginning and 120.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:52:29,637 INFO L168 Benchmark]: RCFGBuilder took 590.77 ms. Allocated memory is still 146.8 MB. Free memory was 120.6 MB in the beginning and 98.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 20:52:29,637 INFO L168 Benchmark]: BuchiAutomizer took 11862.76 ms. Allocated memory was 146.8 MB in the beginning and 4.6 GB in the end (delta: 4.5 GB). Free memory was 98.6 MB in the beginning and 4.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 661.8 MB. Max. memory is 16.1 GB. [2020-11-29 20:52:29,638 INFO L168 Benchmark]: Witness Printer took 70.82 ms. Allocated memory is still 4.6 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:52:29,641 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01 ms. Allocated memory is still 94.4 MB. Free memory is still 52.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 370.78 ms. Allocated memory is still 146.8 MB. Free memory was 121.0 MB in the beginning and 123.8 MB in the end (delta: -2.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.50 ms. Allocated memory is still 146.8 MB. Free memory was 123.8 MB in the beginning and 121.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.82 ms. Allocated memory is still 146.8 MB. Free memory was 121.7 MB in the beginning and 120.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 590.77 ms. Allocated memory is still 146.8 MB. Free memory was 120.6 MB in the beginning and 98.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 11862.76 ms. Allocated memory was 146.8 MB in the beginning and 4.6 GB in the end (delta: 4.5 GB). Free memory was 98.6 MB in the beginning and 4.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 661.8 MB. Max. memory is 16.1 GB. * Witness Printer took 70.82 ms. Allocated memory is still 4.6 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72706 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 3.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.4s Buchi closure took 0.1s. Biggest automaton had 72706 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1133 SDtfs, 589 SDslu, 709 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 50]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=15047} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=15047, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c0d4164=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@166bd005=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b0c8cd6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45081456=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ee5cc9c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1516428d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e87fd47=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54534332=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72f33ebd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a50231e=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=15050, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e1a94d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b2e7b54=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a861114=0, lk13=0, p13=0, p11=0, lk11=0, cond=11, NULL=15049, NULL=0, NULL=15048, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a1316c5=11, lk4=0, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 50]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...