./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-1.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_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/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 04dfa849b43716e8587b0fc4953cadbe3968c4e3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:39:31,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:39:31,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:39:31,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:39:31,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:39:31,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:39:31,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:39:31,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:39:31,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:39:31,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:39:31,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:39:31,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:39:31,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:39:31,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:39:31,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:39:31,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:39:31,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:39:31,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:39:31,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:39:31,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:39:31,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:39:31,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:39:31,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:39:31,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:39:31,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:39:31,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:39:31,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:39:31,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:39:31,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:39:31,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:39:31,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:39:31,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:39:31,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:39:31,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:39:31,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:39:31,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:39:31,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:39:31,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:39:31,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:39:31,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:39:31,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:39:31,291 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 18:39:31,350 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:39:31,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:39:31,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:39:31,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:39:31,354 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:39:31,355 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 18:39:31,355 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 18:39:31,355 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 18:39:31,356 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 18:39:31,356 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 18:39:31,357 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 18:39:31,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:39:31,358 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:39:31,359 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 18:39:31,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:39:31,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:39:31,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:39:31,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 18:39:31,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 18:39:31,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 18:39:31,361 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:39:31,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:39:31,361 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 18:39:31,362 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:39:31,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 18:39:31,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:39:31,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:39:31,363 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 18:39:31,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:39:31,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 18:39:31,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:39:31,366 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 18:39:31,368 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 18:39:31,368 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_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/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_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/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 -> 04dfa849b43716e8587b0fc4953cadbe3968c4e3 [2020-11-29 18:39:31,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:39:31,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:39:31,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:39:31,746 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:39:31,749 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:39:31,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_15-1.c [2020-11-29 18:39:31,847 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/data/62f5a7261/d2c3bbad15794a20883c3b7dfd956cb4/FLAG08ffe9383 [2020-11-29 18:39:32,417 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:39:32,418 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/sv-benchmarks/c/locks/test_locks_15-1.c [2020-11-29 18:39:32,429 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/data/62f5a7261/d2c3bbad15794a20883c3b7dfd956cb4/FLAG08ffe9383 [2020-11-29 18:39:32,759 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/data/62f5a7261/d2c3bbad15794a20883c3b7dfd956cb4 [2020-11-29 18:39:32,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:39:32,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:39:32,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:39:32,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:39:32,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:39:32,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:39:32" (1/1) ... [2020-11-29 18:39:32,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2cc998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:32, skipping insertion in model container [2020-11-29 18:39:32,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:39:32" (1/1) ... [2020-11-29 18:39:32,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:39:32,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:39:33,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:39:33,095 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:39:33,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:39:33,153 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:39:33,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33 WrapperNode [2020-11-29 18:39:33,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:39:33,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:39:33,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:39:33,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:39:33,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... [2020-11-29 18:39:33,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... [2020-11-29 18:39:33,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:39:33,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:39:33,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:39:33,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:39:33,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... [2020-11-29 18:39:33,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... [2020-11-29 18:39:33,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... [2020-11-29 18:39:33,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... [2020-11-29 18:39:33,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... [2020-11-29 18:39:33,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... [2020-11-29 18:39:33,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... [2020-11-29 18:39:33,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:39:33,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:39:33,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:39:33,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:39:33,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/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 18:39:33,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:39:33,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:39:33,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:39:33,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:39:33,986 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:39:33,987 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-29 18:39:33,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:33 BoogieIcfgContainer [2020-11-29 18:39:33,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:39:33,991 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 18:39:33,991 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 18:39:33,995 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 18:39:33,996 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 18:39:34,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 06:39:32" (1/3) ... [2020-11-29 18:39:34,012 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34194c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:39:34, skipping insertion in model container [2020-11-29 18:39:34,012 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 18:39:34,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:33" (2/3) ... [2020-11-29 18:39:34,013 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34194c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:39:34, skipping insertion in model container [2020-11-29 18:39:34,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 18:39:34,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:33" (3/3) ... [2020-11-29 18:39:34,015 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2020-11-29 18:39:34,108 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 18:39:34,108 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 18:39:34,108 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 18:39:34,109 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:39:34,109 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:39:34,109 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 18:39:34,109 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:39:34,109 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 18:39:34,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2020-11-29 18:39:34,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-11-29 18:39:34,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:34,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:34,159 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:34,160 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:34,160 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 18:39:34,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2020-11-29 18:39:34,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-11-29 18:39:34,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:34,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:34,168 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:34,169 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:34,176 INFO L794 eck$LassoCheckResult]: Stem: 26#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 9#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 52#L225-1true [2020-11-29 18:39:34,178 INFO L796 eck$LassoCheckResult]: Loop: 52#L225-1true assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 3#L58true 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 36#L93true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L93-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 53#L97-1true assume !(0 != main_~p3~0); 56#L101-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 48#L105-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 14#L109-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 5#L113-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 8#L117-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 29#L121-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 21#L125-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 41#L129-1true assume !(0 != main_~p11~0); 44#L133-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 38#L137-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 54#L141-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 45#L145-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 50#L149-1true assume !(0 != main_~p1~0); 32#L155-1true assume 0 != main_~p2~0; 27#L161true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 10#L160true assume !(0 != main_~p3~0); 31#L165-1true assume !(0 != main_~p4~0); 39#L170-1true assume !(0 != main_~p5~0); 19#L175-1true assume !(0 != main_~p6~0); 24#L180-1true assume !(0 != main_~p7~0); 55#L185-1true assume !(0 != main_~p8~0); 6#L190-1true assume !(0 != main_~p9~0); 42#L195-1true assume !(0 != main_~p10~0); 47#L200-1true assume !(0 != main_~p11~0); 28#L205-1true assume !(0 != main_~p12~0); 35#L210-1true assume !(0 != main_~p13~0); 12#L215-1true assume 0 != main_~p14~0; 37#L221true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 22#L220true assume !(0 != main_~p15~0); 52#L225-1true [2020-11-29 18:39:34,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 18:39:34,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:34,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788410527] [2020-11-29 18:39:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:34,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:34,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:34,387 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:34,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2020-11-29 18:39:34,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:34,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638940761] [2020-11-29 18:39:34,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:34,533 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 18:39:34,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638940761] [2020-11-29 18:39:34,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:34,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:34,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106833487] [2020-11-29 18:39:34,548 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:34,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:34,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:34,577 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2020-11-29 18:39:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:34,656 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2020-11-29 18:39:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:34,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2020-11-29 18:39:34,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2020-11-29 18:39:34,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 149 transitions. [2020-11-29 18:39:34,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2020-11-29 18:39:34,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2020-11-29 18:39:34,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2020-11-29 18:39:34,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:34,694 INFO L691 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2020-11-29 18:39:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2020-11-29 18:39:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-11-29 18:39:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-29 18:39:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2020-11-29 18:39:34,757 INFO L714 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2020-11-29 18:39:34,757 INFO L594 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2020-11-29 18:39:34,757 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 18:39:34,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2020-11-29 18:39:34,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2020-11-29 18:39:34,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:34,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:34,773 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:34,773 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:34,774 INFO L794 eck$LassoCheckResult]: Stem: 200#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 181#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 182#L225-1 [2020-11-29 18:39:34,774 INFO L796 eck$LassoCheckResult]: Loop: 182#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 171#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 172#L93 assume !(0 != main_~p1~0); 226#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 224#L97-1 assume !(0 != main_~p3~0); 225#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 222#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 190#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 173#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 174#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 180#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 198#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 199#L129-1 assume !(0 != main_~p11~0); 215#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 212#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 213#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 219#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 220#L149-1 assume !(0 != main_~p1~0); 229#L155-1 assume 0 != main_~p2~0; 263#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 262#L160 assume !(0 != main_~p3~0); 260#L165-1 assume !(0 != main_~p4~0); 257#L170-1 assume !(0 != main_~p5~0); 256#L175-1 assume !(0 != main_~p6~0); 254#L180-1 assume !(0 != main_~p7~0); 251#L185-1 assume !(0 != main_~p8~0); 250#L190-1 assume !(0 != main_~p9~0); 216#L195-1 assume !(0 != main_~p10~0); 179#L200-1 assume !(0 != main_~p11~0); 218#L205-1 assume !(0 != main_~p12~0); 209#L210-1 assume !(0 != main_~p13~0); 188#L215-1 assume 0 != main_~p14~0; 189#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 210#L220 assume !(0 != main_~p15~0); 182#L225-1 [2020-11-29 18:39:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-29 18:39:34,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:34,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093277554] [2020-11-29 18:39:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:34,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:34,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:34,865 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:34,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2020-11-29 18:39:34,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:34,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782266290] [2020-11-29 18:39:34,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:34,987 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 18:39:34,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782266290] [2020-11-29 18:39:34,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:34,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:34,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799642600] [2020-11-29 18:39:34,992 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:34,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:34,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:34,998 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand 3 states. [2020-11-29 18:39:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:35,047 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2020-11-29 18:39:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:35,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2020-11-29 18:39:35,053 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2020-11-29 18:39:35,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2020-11-29 18:39:35,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2020-11-29 18:39:35,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2020-11-29 18:39:35,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2020-11-29 18:39:35,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:35,076 INFO L691 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2020-11-29 18:39:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2020-11-29 18:39:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-11-29 18:39:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-29 18:39:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2020-11-29 18:39:35,106 INFO L714 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2020-11-29 18:39:35,106 INFO L594 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2020-11-29 18:39:35,107 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 18:39:35,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2020-11-29 18:39:35,115 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2020-11-29 18:39:35,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:35,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:35,119 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:35,119 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:35,120 INFO L794 eck$LassoCheckResult]: Stem: 487#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 468#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 469#L225-1 [2020-11-29 18:39:35,120 INFO L796 eck$LassoCheckResult]: Loop: 469#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 558#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 555#L93 assume !(0 != main_~p1~0); 552#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 510#L97-1 assume !(0 != main_~p3~0); 511#L101-1 assume !(0 != main_~p4~0); 548#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 637#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 636#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 635#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 632#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 629#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 626#L129-1 assume !(0 != main_~p11~0); 625#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 624#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 623#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 621#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 620#L149-1 assume !(0 != main_~p1~0); 493#L155-1 assume 0 != main_~p2~0; 494#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 520#L160 assume !(0 != main_~p3~0); 516#L165-1 assume !(0 != main_~p4~0); 517#L170-1 assume !(0 != main_~p5~0); 619#L175-1 assume !(0 != main_~p6~0); 617#L180-1 assume !(0 != main_~p7~0); 614#L185-1 assume !(0 != main_~p8~0); 613#L190-1 assume !(0 != main_~p9~0); 590#L195-1 assume !(0 != main_~p10~0); 588#L200-1 assume !(0 != main_~p11~0); 586#L205-1 assume !(0 != main_~p12~0); 575#L210-1 assume !(0 != main_~p13~0); 571#L215-1 assume 0 != main_~p14~0; 569#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 565#L220 assume !(0 != main_~p15~0); 469#L225-1 [2020-11-29 18:39:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-29 18:39:35,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:35,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100967485] [2020-11-29 18:39:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:35,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:35,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:35,198 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:35,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2020-11-29 18:39:35,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:35,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856387466] [2020-11-29 18:39:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:35,309 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 18:39:35,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856387466] [2020-11-29 18:39:35,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:35,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:35,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19654406] [2020-11-29 18:39:35,314 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:35,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:35,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:35,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:35,316 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand 3 states. [2020-11-29 18:39:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:35,360 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2020-11-29 18:39:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:35,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2020-11-29 18:39:35,367 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2020-11-29 18:39:35,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2020-11-29 18:39:35,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2020-11-29 18:39:35,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2020-11-29 18:39:35,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2020-11-29 18:39:35,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:35,389 INFO L691 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2020-11-29 18:39:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2020-11-29 18:39:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2020-11-29 18:39:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-11-29 18:39:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2020-11-29 18:39:35,432 INFO L714 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2020-11-29 18:39:35,432 INFO L594 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2020-11-29 18:39:35,433 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 18:39:35,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2020-11-29 18:39:35,438 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2020-11-29 18:39:35,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:35,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:35,440 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:35,440 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:35,442 INFO L794 eck$LassoCheckResult]: Stem: 1047#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1026#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1027#L225-1 [2020-11-29 18:39:35,443 INFO L796 eck$LassoCheckResult]: Loop: 1027#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1151#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 1149#L93 assume !(0 != main_~p1~0); 1147#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1145#L97-1 assume !(0 != main_~p3~0); 1118#L101-1 assume !(0 != main_~p4~0); 1119#L105-1 assume !(0 != main_~p5~0); 1375#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1373#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1370#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1368#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1044#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1045#L129-1 assume !(0 != main_~p11~0); 1309#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1306#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1303#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1301#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1298#L149-1 assume !(0 != main_~p1~0); 1295#L155-1 assume 0 != main_~p2~0; 1292#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1288#L160 assume !(0 != main_~p3~0); 1284#L165-1 assume !(0 != main_~p4~0); 1281#L170-1 assume !(0 != main_~p5~0); 1277#L175-1 assume !(0 != main_~p6~0); 1263#L180-1 assume !(0 != main_~p7~0); 1257#L185-1 assume !(0 != main_~p8~0); 1216#L190-1 assume !(0 != main_~p9~0); 1192#L195-1 assume !(0 != main_~p10~0); 1190#L200-1 assume !(0 != main_~p11~0); 1188#L205-1 assume !(0 != main_~p12~0); 1186#L210-1 assume !(0 != main_~p13~0); 1182#L215-1 assume 0 != main_~p14~0; 1180#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1156#L220 assume !(0 != main_~p15~0); 1027#L225-1 [2020-11-29 18:39:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-29 18:39:35,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:35,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076665195] [2020-11-29 18:39:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:35,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:35,491 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:35,497 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2020-11-29 18:39:35,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:35,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619472504] [2020-11-29 18:39:35,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:35,530 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 18:39:35,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619472504] [2020-11-29 18:39:35,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:35,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:35,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521298495] [2020-11-29 18:39:35,532 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:35,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:35,534 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand 3 states. [2020-11-29 18:39:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:35,611 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2020-11-29 18:39:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:35,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2020-11-29 18:39:35,624 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2020-11-29 18:39:35,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2020-11-29 18:39:35,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2020-11-29 18:39:35,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2020-11-29 18:39:35,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2020-11-29 18:39:35,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:35,637 INFO L691 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2020-11-29 18:39:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2020-11-29 18:39:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2020-11-29 18:39:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2020-11-29 18:39:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2020-11-29 18:39:35,670 INFO L714 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2020-11-29 18:39:35,671 INFO L594 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2020-11-29 18:39:35,671 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 18:39:35,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2020-11-29 18:39:35,679 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2020-11-29 18:39:35,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:35,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:35,683 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:35,684 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:35,688 INFO L794 eck$LassoCheckResult]: Stem: 2140#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2120#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 2121#L225-1 [2020-11-29 18:39:35,688 INFO L796 eck$LassoCheckResult]: Loop: 2121#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 2302#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 2299#L93 assume !(0 != main_~p1~0); 2297#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2295#L97-1 assume !(0 != main_~p3~0); 2230#L101-1 assume !(0 != main_~p4~0); 2231#L105-1 assume !(0 != main_~p5~0); 2378#L109-1 assume !(0 != main_~p6~0); 2376#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2374#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2371#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2369#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2367#L129-1 assume !(0 != main_~p11~0); 2365#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2364#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2362#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2360#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2357#L149-1 assume !(0 != main_~p1~0); 2354#L155-1 assume 0 != main_~p2~0; 2351#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2348#L160 assume !(0 != main_~p3~0); 2343#L165-1 assume !(0 != main_~p4~0); 2339#L170-1 assume !(0 != main_~p5~0); 2335#L175-1 assume !(0 != main_~p6~0); 2332#L180-1 assume !(0 != main_~p7~0); 2328#L185-1 assume !(0 != main_~p8~0); 2326#L190-1 assume !(0 != main_~p9~0); 2322#L195-1 assume !(0 != main_~p10~0); 2319#L200-1 assume !(0 != main_~p11~0); 2316#L205-1 assume !(0 != main_~p12~0); 2313#L210-1 assume !(0 != main_~p13~0); 2311#L215-1 assume 0 != main_~p14~0; 2309#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2306#L220 assume !(0 != main_~p15~0); 2121#L225-1 [2020-11-29 18:39:35,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-11-29 18:39:35,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:35,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247066254] [2020-11-29 18:39:35,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:35,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:35,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:35,745 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:35,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:35,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2020-11-29 18:39:35,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:35,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295426819] [2020-11-29 18:39:35,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:35,795 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 18:39:35,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295426819] [2020-11-29 18:39:35,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:35,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:35,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263462508] [2020-11-29 18:39:35,797 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:35,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:35,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:35,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:35,799 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand 3 states. [2020-11-29 18:39:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:35,831 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2020-11-29 18:39:35,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:35,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2020-11-29 18:39:35,878 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2020-11-29 18:39:35,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2020-11-29 18:39:35,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2020-11-29 18:39:35,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2020-11-29 18:39:35,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2020-11-29 18:39:35,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:35,899 INFO L691 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2020-11-29 18:39:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2020-11-29 18:39:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2020-11-29 18:39:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2020-11-29 18:39:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2020-11-29 18:39:35,946 INFO L714 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2020-11-29 18:39:35,946 INFO L594 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2020-11-29 18:39:35,947 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 18:39:35,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2020-11-29 18:39:35,960 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2020-11-29 18:39:35,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:35,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:35,961 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:35,961 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:35,961 INFO L794 eck$LassoCheckResult]: Stem: 4293#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4274#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 4275#L225-1 [2020-11-29 18:39:35,962 INFO L796 eck$LassoCheckResult]: Loop: 4275#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 4708#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 4700#L93 assume !(0 != main_~p1~0); 4701#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4689#L97-1 assume !(0 != main_~p3~0); 4690#L101-1 assume !(0 != main_~p4~0); 4679#L105-1 assume !(0 != main_~p5~0); 4681#L109-1 assume !(0 != main_~p6~0); 4776#L113-1 assume !(0 != main_~p7~0); 4775#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4774#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4773#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4772#L129-1 assume !(0 != main_~p11~0); 4771#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4770#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4769#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4768#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4765#L149-1 assume !(0 != main_~p1~0); 4764#L155-1 assume 0 != main_~p2~0; 4763#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4761#L160 assume !(0 != main_~p3~0); 4587#L165-1 assume !(0 != main_~p4~0); 4588#L170-1 assume !(0 != main_~p5~0); 4572#L175-1 assume !(0 != main_~p6~0); 4574#L180-1 assume !(0 != main_~p7~0); 4758#L185-1 assume !(0 != main_~p8~0); 4748#L190-1 assume !(0 != main_~p9~0); 4747#L195-1 assume !(0 != main_~p10~0); 4738#L200-1 assume !(0 != main_~p11~0); 4737#L205-1 assume !(0 != main_~p12~0); 4727#L210-1 assume !(0 != main_~p13~0); 4726#L215-1 assume 0 != main_~p14~0; 4716#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4717#L220 assume !(0 != main_~p15~0); 4275#L225-1 [2020-11-29 18:39:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-11-29 18:39:35,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:35,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238659310] [2020-11-29 18:39:35,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:35,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:36,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:36,011 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2020-11-29 18:39:36,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:36,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526377186] [2020-11-29 18:39:36,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:36,065 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 18:39:36,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526377186] [2020-11-29 18:39:36,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:36,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:36,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323206956] [2020-11-29 18:39:36,068 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:36,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:36,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:36,070 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand 3 states. [2020-11-29 18:39:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:36,120 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2020-11-29 18:39:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:36,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2020-11-29 18:39:36,170 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2020-11-29 18:39:36,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2020-11-29 18:39:36,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2020-11-29 18:39:36,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2020-11-29 18:39:36,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2020-11-29 18:39:36,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:36,217 INFO L691 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2020-11-29 18:39:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2020-11-29 18:39:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2020-11-29 18:39:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-11-29 18:39:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2020-11-29 18:39:36,318 INFO L714 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2020-11-29 18:39:36,318 INFO L594 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2020-11-29 18:39:36,318 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 18:39:36,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2020-11-29 18:39:36,353 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2020-11-29 18:39:36,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:36,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:36,357 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:36,358 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:36,358 INFO L794 eck$LassoCheckResult]: Stem: 8545#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8524#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 8525#L225-1 [2020-11-29 18:39:36,359 INFO L796 eck$LassoCheckResult]: Loop: 8525#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 8885#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 8881#L93 assume !(0 != main_~p1~0); 8878#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8876#L97-1 assume !(0 != main_~p3~0); 8665#L101-1 assume !(0 != main_~p4~0); 8666#L105-1 assume !(0 != main_~p5~0); 9038#L109-1 assume !(0 != main_~p6~0); 9032#L113-1 assume !(0 != main_~p7~0); 9025#L117-1 assume !(0 != main_~p8~0); 9018#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 9012#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 9006#L129-1 assume !(0 != main_~p11~0); 8986#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8984#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8982#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8979#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8950#L149-1 assume !(0 != main_~p1~0); 8948#L155-1 assume 0 != main_~p2~0; 8947#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8946#L160 assume !(0 != main_~p3~0); 8932#L165-1 assume !(0 != main_~p4~0); 8933#L170-1 assume !(0 != main_~p5~0); 8943#L175-1 assume !(0 != main_~p6~0); 8935#L180-1 assume !(0 != main_~p7~0); 8926#L185-1 assume !(0 != main_~p8~0); 8921#L190-1 assume !(0 != main_~p9~0); 8914#L195-1 assume !(0 != main_~p10~0); 8907#L200-1 assume !(0 != main_~p11~0); 8903#L205-1 assume !(0 != main_~p12~0); 8900#L210-1 assume !(0 != main_~p13~0); 8897#L215-1 assume 0 != main_~p14~0; 8894#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 8891#L220 assume !(0 != main_~p15~0); 8525#L225-1 [2020-11-29 18:39:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:36,360 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-11-29 18:39:36,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:36,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078277561] [2020-11-29 18:39:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:36,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:36,386 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:36,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:36,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:36,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2020-11-29 18:39:36,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:36,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088849835] [2020-11-29 18:39:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:36,452 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 18:39:36,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088849835] [2020-11-29 18:39:36,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:36,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:36,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885847177] [2020-11-29 18:39:36,453 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:36,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:36,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:36,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:36,454 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2020-11-29 18:39:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:36,517 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2020-11-29 18:39:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:36,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2020-11-29 18:39:36,625 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2020-11-29 18:39:36,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2020-11-29 18:39:36,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2020-11-29 18:39:36,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2020-11-29 18:39:36,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2020-11-29 18:39:36,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:36,701 INFO L691 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2020-11-29 18:39:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2020-11-29 18:39:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2020-11-29 18:39:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5570 states. [2020-11-29 18:39:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2020-11-29 18:39:36,931 INFO L714 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2020-11-29 18:39:36,932 INFO L594 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2020-11-29 18:39:36,932 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 18:39:36,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2020-11-29 18:39:36,978 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2020-11-29 18:39:36,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:36,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:36,979 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:36,979 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:36,979 INFO L794 eck$LassoCheckResult]: Stem: 16939#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 16918#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 16919#L225-1 [2020-11-29 18:39:36,983 INFO L796 eck$LassoCheckResult]: Loop: 16919#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 17064#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 17062#L93 assume !(0 != main_~p1~0); 17060#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 17058#L97-1 assume !(0 != main_~p3~0); 17054#L101-1 assume !(0 != main_~p4~0); 17050#L105-1 assume !(0 != main_~p5~0); 17046#L109-1 assume !(0 != main_~p6~0); 17042#L113-1 assume !(0 != main_~p7~0); 17038#L117-1 assume !(0 != main_~p8~0); 17034#L121-1 assume !(0 != main_~p9~0); 17032#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17030#L129-1 assume !(0 != main_~p11~0); 17028#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17026#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17024#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17022#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17020#L149-1 assume !(0 != main_~p1~0); 17014#L155-1 assume 0 != main_~p2~0; 17015#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 17006#L160 assume !(0 != main_~p3~0); 17005#L165-1 assume !(0 != main_~p4~0); 17107#L170-1 assume !(0 != main_~p5~0); 17103#L175-1 assume !(0 != main_~p6~0); 17099#L180-1 assume !(0 != main_~p7~0); 17095#L185-1 assume !(0 != main_~p8~0); 17091#L190-1 assume !(0 != main_~p9~0); 17088#L195-1 assume !(0 != main_~p10~0); 17084#L200-1 assume !(0 != main_~p11~0); 17080#L205-1 assume !(0 != main_~p12~0); 17076#L210-1 assume !(0 != main_~p13~0); 17073#L215-1 assume 0 != main_~p14~0; 17071#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 17068#L220 assume !(0 != main_~p15~0); 16919#L225-1 [2020-11-29 18:39:36,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:36,984 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-11-29 18:39:36,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:36,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358991898] [2020-11-29 18:39:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:37,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:37,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:37,027 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:37,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2020-11-29 18:39:37,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:37,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618199661] [2020-11-29 18:39:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:37,072 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 18:39:37,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618199661] [2020-11-29 18:39:37,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:37,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:37,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24333462] [2020-11-29 18:39:37,074 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:37,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:37,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:37,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:37,075 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2020-11-29 18:39:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:37,161 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2020-11-29 18:39:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:37,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2020-11-29 18:39:37,307 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2020-11-29 18:39:37,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2020-11-29 18:39:37,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2020-11-29 18:39:37,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2020-11-29 18:39:37,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2020-11-29 18:39:37,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:37,502 INFO L691 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2020-11-29 18:39:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2020-11-29 18:39:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2020-11-29 18:39:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11010 states. [2020-11-29 18:39:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2020-11-29 18:39:37,971 INFO L714 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2020-11-29 18:39:37,972 INFO L594 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2020-11-29 18:39:37,972 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 18:39:37,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2020-11-29 18:39:38,165 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2020-11-29 18:39:38,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:38,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:38,166 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:38,166 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:38,166 INFO L794 eck$LassoCheckResult]: Stem: 33524#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 33504#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 33505#L225-1 [2020-11-29 18:39:38,166 INFO L796 eck$LassoCheckResult]: Loop: 33505#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 33661#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 33659#L93 assume !(0 != main_~p1~0); 33657#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 33655#L97-1 assume !(0 != main_~p3~0); 33651#L101-1 assume !(0 != main_~p4~0); 33647#L105-1 assume !(0 != main_~p5~0); 33643#L109-1 assume !(0 != main_~p6~0); 33639#L113-1 assume !(0 != main_~p7~0); 33635#L117-1 assume !(0 != main_~p8~0); 33631#L121-1 assume !(0 != main_~p9~0); 33627#L125-1 assume !(0 != main_~p10~0); 33625#L129-1 assume !(0 != main_~p11~0); 33623#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33621#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33619#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33617#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33615#L149-1 assume !(0 != main_~p1~0); 33610#L155-1 assume 0 != main_~p2~0; 33607#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 33603#L160 assume !(0 != main_~p3~0); 33602#L165-1 assume !(0 != main_~p4~0); 33704#L170-1 assume !(0 != main_~p5~0); 33700#L175-1 assume !(0 != main_~p6~0); 33696#L180-1 assume !(0 != main_~p7~0); 33692#L185-1 assume !(0 != main_~p8~0); 33688#L190-1 assume !(0 != main_~p9~0); 33684#L195-1 assume !(0 != main_~p10~0); 33681#L200-1 assume !(0 != main_~p11~0); 33677#L205-1 assume !(0 != main_~p12~0); 33673#L210-1 assume !(0 != main_~p13~0); 33670#L215-1 assume 0 != main_~p14~0; 33668#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 33665#L220 assume !(0 != main_~p15~0); 33505#L225-1 [2020-11-29 18:39:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:38,167 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-11-29 18:39:38,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:38,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342884201] [2020-11-29 18:39:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:38,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:38,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:38,196 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:38,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2020-11-29 18:39:38,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:38,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642792835] [2020-11-29 18:39:38,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:38,228 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 18:39:38,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642792835] [2020-11-29 18:39:38,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:38,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:38,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370281638] [2020-11-29 18:39:38,229 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:38,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:38,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:38,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:38,230 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2020-11-29 18:39:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:38,345 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2020-11-29 18:39:38,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:38,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2020-11-29 18:39:38,561 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2020-11-29 18:39:38,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2020-11-29 18:39:38,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2020-11-29 18:39:38,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2020-11-29 18:39:38,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2020-11-29 18:39:38,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:38,793 INFO L691 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2020-11-29 18:39:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2020-11-29 18:39:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2020-11-29 18:39:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21762 states. [2020-11-29 18:39:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2020-11-29 18:39:39,347 INFO L714 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2020-11-29 18:39:39,347 INFO L594 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2020-11-29 18:39:39,347 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 18:39:39,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2020-11-29 18:39:39,448 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2020-11-29 18:39:39,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:39,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:39,450 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:39,450 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:39,451 INFO L794 eck$LassoCheckResult]: Stem: 66301#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 66281#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 66282#L225-1 [2020-11-29 18:39:39,451 INFO L796 eck$LassoCheckResult]: Loop: 66282#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 66478#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 66474#L93 assume !(0 != main_~p1~0); 66470#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 66466#L97-1 assume !(0 != main_~p3~0); 66459#L101-1 assume !(0 != main_~p4~0); 66451#L105-1 assume !(0 != main_~p5~0); 66443#L109-1 assume !(0 != main_~p6~0); 66435#L113-1 assume !(0 != main_~p7~0); 66427#L117-1 assume !(0 != main_~p8~0); 66419#L121-1 assume !(0 != main_~p9~0); 66411#L125-1 assume !(0 != main_~p10~0); 66406#L129-1 assume !(0 != main_~p11~0); 66400#L133-1 assume !(0 != main_~p12~0); 66401#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66391#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66392#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66383#L149-1 assume !(0 != main_~p1~0); 66384#L155-1 assume 0 != main_~p2~0; 66375#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 66376#L160 assume !(0 != main_~p3~0); 66577#L165-1 assume !(0 != main_~p4~0); 66573#L170-1 assume !(0 != main_~p5~0); 66569#L175-1 assume !(0 != main_~p6~0); 66548#L180-1 assume !(0 != main_~p7~0); 66540#L185-1 assume !(0 != main_~p8~0); 66532#L190-1 assume !(0 != main_~p9~0); 66525#L195-1 assume !(0 != main_~p10~0); 66519#L200-1 assume !(0 != main_~p11~0); 66516#L205-1 assume !(0 != main_~p12~0); 66515#L210-1 assume !(0 != main_~p13~0); 66513#L215-1 assume 0 != main_~p14~0; 66490#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 66487#L220 assume !(0 != main_~p15~0); 66282#L225-1 [2020-11-29 18:39:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-11-29 18:39:39,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:39,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763101945] [2020-11-29 18:39:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:39,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:39,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:39,484 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2020-11-29 18:39:39,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:39,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696811900] [2020-11-29 18:39:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:39,517 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 18:39:39,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696811900] [2020-11-29 18:39:39,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:39,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:39:39,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461448342] [2020-11-29 18:39:39,518 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:39,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:39,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:39,519 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2020-11-29 18:39:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:40,142 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2020-11-29 18:39:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:40,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2020-11-29 18:39:40,562 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2020-11-29 18:39:40,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2020-11-29 18:39:40,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2020-11-29 18:39:40,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2020-11-29 18:39:40,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2020-11-29 18:39:41,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:41,003 INFO L691 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2020-11-29 18:39:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2020-11-29 18:39:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2020-11-29 18:39:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43010 states. [2020-11-29 18:39:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2020-11-29 18:39:41,928 INFO L714 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2020-11-29 18:39:41,928 INFO L594 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2020-11-29 18:39:41,928 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 18:39:41,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2020-11-29 18:39:42,361 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2020-11-29 18:39:42,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:42,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:42,363 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:42,363 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:42,364 INFO L794 eck$LassoCheckResult]: Stem: 131080#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 131059#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 131060#L225-1 [2020-11-29 18:39:42,366 INFO L796 eck$LassoCheckResult]: Loop: 131060#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 131338#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 131335#L93 assume !(0 != main_~p1~0); 131331#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 131327#L97-1 assume !(0 != main_~p3~0); 131296#L101-1 assume !(0 != main_~p4~0); 131292#L105-1 assume !(0 != main_~p5~0); 131288#L109-1 assume !(0 != main_~p6~0); 131284#L113-1 assume !(0 != main_~p7~0); 131281#L117-1 assume !(0 != main_~p8~0); 131197#L121-1 assume !(0 != main_~p9~0); 131193#L125-1 assume !(0 != main_~p10~0); 131180#L129-1 assume !(0 != main_~p11~0); 131181#L133-1 assume !(0 != main_~p12~0); 131458#L137-1 assume !(0 != main_~p13~0); 131459#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131577#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131574#L149-1 assume !(0 != main_~p1~0); 131571#L155-1 assume 0 != main_~p2~0; 131569#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 131564#L160 assume !(0 != main_~p3~0); 131556#L165-1 assume !(0 != main_~p4~0); 131548#L170-1 assume !(0 != main_~p5~0); 131543#L175-1 assume !(0 != main_~p6~0); 131538#L180-1 assume !(0 != main_~p7~0); 131534#L185-1 assume !(0 != main_~p8~0); 131509#L190-1 assume !(0 != main_~p9~0); 131364#L195-1 assume !(0 != main_~p10~0); 131359#L200-1 assume !(0 != main_~p11~0); 131351#L205-1 assume !(0 != main_~p12~0); 131348#L210-1 assume !(0 != main_~p13~0); 131347#L215-1 assume 0 != main_~p14~0; 131345#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 131343#L220 assume !(0 != main_~p15~0); 131060#L225-1 [2020-11-29 18:39:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-11-29 18:39:42,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:42,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521657575] [2020-11-29 18:39:42,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:42,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:42,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:42,393 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2020-11-29 18:39:42,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:42,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907677402] [2020-11-29 18:39:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:42,420 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 18:39:42,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907677402] [2020-11-29 18:39:42,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:42,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 18:39:42,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383198924] [2020-11-29 18:39:42,422 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 18:39:42,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:39:42,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:39:42,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:39:42,423 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2020-11-29 18:39:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:42,942 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2020-11-29 18:39:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:39:42,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2020-11-29 18:39:43,873 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2020-11-29 18:39:44,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2020-11-29 18:39:44,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2020-11-29 18:39:44,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2020-11-29 18:39:44,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2020-11-29 18:39:44,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 18:39:44,668 INFO L691 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2020-11-29 18:39:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2020-11-29 18:39:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2020-11-29 18:39:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84994 states. [2020-11-29 18:39:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2020-11-29 18:39:46,158 INFO L714 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2020-11-29 18:39:46,158 INFO L594 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2020-11-29 18:39:46,158 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 18:39:46,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2020-11-29 18:39:46,482 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2020-11-29 18:39:46,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 18:39:46,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 18:39:46,484 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 18:39:46,484 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, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:46,484 INFO L794 eck$LassoCheckResult]: Stem: 259091#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 259070#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 259071#L225-1 [2020-11-29 18:39:46,485 INFO L796 eck$LassoCheckResult]: Loop: 259071#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 259493#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 259491#L93 assume !(0 != main_~p1~0); 259490#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 259488#L97-1 assume !(0 != main_~p3~0); 259485#L101-1 assume !(0 != main_~p4~0); 259481#L105-1 assume !(0 != main_~p5~0); 259477#L109-1 assume !(0 != main_~p6~0); 259473#L113-1 assume !(0 != main_~p7~0); 259469#L117-1 assume !(0 != main_~p8~0); 259465#L121-1 assume !(0 != main_~p9~0); 259461#L125-1 assume !(0 != main_~p10~0); 259458#L129-1 assume !(0 != main_~p11~0); 259455#L133-1 assume !(0 != main_~p12~0); 259451#L137-1 assume !(0 != main_~p13~0); 259448#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 259445#L145-1 assume !(0 != main_~p15~0); 259446#L149-1 assume !(0 != main_~p1~0); 259545#L155-1 assume 0 != main_~p2~0; 259543#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 259540#L160 assume !(0 != main_~p3~0); 259535#L165-1 assume !(0 != main_~p4~0); 259531#L170-1 assume !(0 != main_~p5~0); 259527#L175-1 assume !(0 != main_~p6~0); 259523#L180-1 assume !(0 != main_~p7~0); 259519#L185-1 assume !(0 != main_~p8~0); 259515#L190-1 assume !(0 != main_~p9~0); 259511#L195-1 assume !(0 != main_~p10~0); 259508#L200-1 assume !(0 != main_~p11~0); 259504#L205-1 assume !(0 != main_~p12~0); 259500#L210-1 assume !(0 != main_~p13~0); 259498#L215-1 assume 0 != main_~p14~0; 259496#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 259494#L220 assume !(0 != main_~p15~0); 259071#L225-1 [2020-11-29 18:39:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2020-11-29 18:39:46,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:46,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318293881] [2020-11-29 18:39:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:46,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:46,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:46,512 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2020-11-29 18:39:46,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:46,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127870343] [2020-11-29 18:39:46,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:46,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:46,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:46,547 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2020-11-29 18:39:46,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:39:46,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205347644] [2020-11-29 18:39:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:39:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:46,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:46,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:46,586 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:39:46,845 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-29 18:39:47,043 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-29 18:39:47,562 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2020-11-29 18:39:47,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 06:39:47 BoogieIcfgContainer [2020-11-29 18:39:47,739 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 18:39:47,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:39:47,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:39:47,741 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:39:47,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:33" (3/4) ... [2020-11-29 18:39:47,745 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-29 18:39:47,852 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3a2ad0d0-4a22-4c42-9b02-5dc15d4b70db/bin/uautomizer/witness.graphml [2020-11-29 18:39:47,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:39:47,858 INFO L168 Benchmark]: Toolchain (without parser) took 15090.68 ms. Allocated memory was 83.9 MB in the beginning and 8.8 GB in the end (delta: 8.7 GB). Free memory was 52.3 MB in the beginning and 7.9 GB in the end (delta: -7.8 GB). Peak memory consumption was 855.2 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:47,859 INFO L168 Benchmark]: CDTParser took 1.14 ms. Allocated memory is still 83.9 MB. Free memory was 45.0 MB in the beginning and 45.0 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:39:47,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.55 ms. Allocated memory is still 83.9 MB. Free memory was 52.1 MB in the beginning and 60.8 MB in the end (delta: -8.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:47,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.71 ms. Allocated memory is still 83.9 MB. Free memory was 60.6 MB in the beginning and 58.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:47,861 INFO L168 Benchmark]: Boogie Preprocessor took 53.02 ms. Allocated memory is still 83.9 MB. Free memory was 58.9 MB in the beginning and 57.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:47,862 INFO L168 Benchmark]: RCFGBuilder took 728.66 ms. Allocated memory is still 83.9 MB. Free memory was 57.4 MB in the beginning and 33.9 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:47,863 INFO L168 Benchmark]: BuchiAutomizer took 13748.44 ms. Allocated memory was 83.9 MB in the beginning and 8.8 GB in the end (delta: 8.7 GB). Free memory was 33.9 MB in the beginning and 7.9 GB in the end (delta: -7.9 GB). Peak memory consumption was 835.2 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:47,863 INFO L168 Benchmark]: Witness Printer took 116.41 ms. Allocated memory is still 8.8 GB. Free memory was 7.9 GB in the beginning and 7.9 GB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:47,866 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.14 ms. Allocated memory is still 83.9 MB. Free memory was 45.0 MB in the beginning and 45.0 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 383.55 ms. Allocated memory is still 83.9 MB. Free memory was 52.1 MB in the beginning and 60.8 MB in the end (delta: -8.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.71 ms. Allocated memory is still 83.9 MB. Free memory was 60.6 MB in the beginning and 58.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.02 ms. Allocated memory is still 83.9 MB. Free memory was 58.9 MB in the beginning and 57.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 728.66 ms. Allocated memory is still 83.9 MB. Free memory was 57.4 MB in the beginning and 33.9 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 13748.44 ms. Allocated memory was 83.9 MB in the beginning and 8.8 GB in the end (delta: 8.7 GB). Free memory was 33.9 MB in the beginning and 7.9 GB in the end (delta: -7.9 GB). Peak memory consumption was 835.2 MB. Max. memory is 16.1 GB. * Witness Printer took 116.41 ms. Allocated memory is still 8.8 GB. Free memory was 7.9 GB in the beginning and 7.9 GB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 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 84994 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 3.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.1s Buchi closure took 0.3s. Biggest automaton had 84994 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1271 SDtfs, 648 SDslu, 801 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: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=16674} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=16674, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f395134=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59461c5e=0, p14=15, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61b16c52=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73393b06=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e2d6564=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70af1013=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ee77f0a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8d35923=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d7619fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74bb52e0=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=16675, \result=0, p2=14, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@300bf22=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72a0aec2=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@469c11c4=0, lk13=0, p15=0, lk15=0, p13=0, p11=0, lk11=0, cond=13, NULL=16676, NULL=0, NULL=16677, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a9621a8=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@204dc8f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@157e8fdf=13, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: 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; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...