./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i -s /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/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 b24fe5aae04e52fa3254bedb47b3233a00d35d78 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:55:50,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:55:50,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:55:50,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:55:50,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:55:50,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:55:50,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:55:50,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:55:50,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:55:50,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:55:50,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:55:50,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:55:50,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:55:50,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:55:50,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:55:50,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:55:50,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:55:50,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:55:50,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:55:50,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:55:50,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:55:50,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:55:50,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:55:50,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:55:50,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:55:50,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:55:50,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:55:50,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:55:50,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:55:50,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:55:50,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:55:50,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:55:50,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:55:50,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:55:50,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:55:50,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:55:50,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:55:50,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:55:50,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:55:50,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:55:50,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:55:50,318 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:55:50,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:55:50,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:55:50,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:55:50,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:55:50,340 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:55:50,340 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:55:50,340 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:55:50,341 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:55:50,341 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:55:50,341 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:55:50,342 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:55:50,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:55:50,342 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:55:50,342 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:55:50,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:55:50,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:55:50,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:55:50,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:55:50,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:55:50,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:55:50,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:55:50,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:55:50,344 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:55:50,344 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:55:50,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:55:50,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:55:50,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:55:50,345 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:55:50,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:55:50,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:55:50,345 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:55:50,347 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:55:50,347 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_259b739e-09f4-4cc9-85c2-367f102e838b/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 -> b24fe5aae04e52fa3254bedb47b3233a00d35d78 [2019-11-25 08:55:50,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:55:50,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:55:50,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:55:50,535 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:55:50,535 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:55:50,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2019-11-25 08:55:50,592 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/data/6725cfc24/faf8c0247c1442a48ee000c9effa3518/FLAG5ed2beb27 [2019-11-25 08:55:51,055 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:55:51,056 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2019-11-25 08:55:51,071 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/data/6725cfc24/faf8c0247c1442a48ee000c9effa3518/FLAG5ed2beb27 [2019-11-25 08:55:51,083 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/bin/uautomizer/data/6725cfc24/faf8c0247c1442a48ee000c9effa3518 [2019-11-25 08:55:51,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:55:51,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:55:51,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:51,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:55:51,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:55:51,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319691ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51, skipping insertion in model container [2019-11-25 08:55:51,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:55:51,136 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:55:51,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:51,612 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:55:51,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:51,734 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:55:51,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51 WrapperNode [2019-11-25 08:55:51,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:51,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:51,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:55:51,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:55:51,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:51,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:55:51,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:55:51,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:55:51,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:55:51,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:55:51,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:55:51,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:55:51,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_259b739e-09f4-4cc9-85c2-367f102e838b/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 [2019-11-25 08:55:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:55:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:55:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:55:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:55:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:55:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 08:55:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:55:51,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:55:52,655 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:55:52,655 INFO L284 CfgBuilder]: Removed 74 assume(true) statements. [2019-11-25 08:55:52,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:52 BoogieIcfgContainer [2019-11-25 08:55:52,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:55:52,657 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:55:52,658 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:55:52,661 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:55:52,661 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:55:52,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:55:51" (1/3) ... [2019-11-25 08:55:52,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60f3b6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:55:52, skipping insertion in model container [2019-11-25 08:55:52,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:55:52,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (2/3) ... [2019-11-25 08:55:52,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60f3b6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:55:52, skipping insertion in model container [2019-11-25 08:55:52,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:55:52,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:52" (3/3) ... [2019-11-25 08:55:52,666 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_mutex_double_lock.i [2019-11-25 08:55:52,719 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:55:52,720 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:55:52,720 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:55:52,720 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:55:52,720 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:55:52,720 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:55:52,720 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:55:52,720 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:55:52,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-11-25 08:55:52,769 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-11-25 08:55:52,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:52,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:52,775 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:55:52,775 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:55:52,776 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:55:52,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-11-25 08:55:52,789 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-11-25 08:55:52,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:52,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:52,790 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:55:52,790 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:55:52,797 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 10#L-1true havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 48#L652true ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 35#L564true foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 38#L564-1true foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 36#L641-3true [2019-11-25 08:55:52,797 INFO L796 eck$LassoCheckResult]: Loop: 36#L641-3true assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 56#L642true assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 49#L641-2true call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 36#L641-3true [2019-11-25 08:55:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:52,803 INFO L82 PathProgramCache]: Analyzing trace with hash 28692771, now seen corresponding path program 1 times [2019-11-25 08:55:52,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:52,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704554345] [2019-11-25 08:55:52,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:53,014 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:53,015 INFO L82 PathProgramCache]: Analyzing trace with hash 45841, now seen corresponding path program 1 times [2019-11-25 08:55:53,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:53,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115925345] [2019-11-25 08:55:53,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:53,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:53,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:53,048 INFO L82 PathProgramCache]: Analyzing trace with hash 87865007, now seen corresponding path program 1 times [2019-11-25 08:55:53,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:53,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572479904] [2019-11-25 08:55:53,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:53,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572479904] [2019-11-25 08:55:53,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:53,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:53,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436161842] [2019-11-25 08:55:53,312 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-25 08:55:53,592 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 08:55:53,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:53,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:53,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:53,612 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-11-25 08:55:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:53,865 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-11-25 08:55:53,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:53,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-11-25 08:55:53,871 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 38 [2019-11-25 08:55:53,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 100 states and 120 transitions. [2019-11-25 08:55:53,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-11-25 08:55:53,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-11-25 08:55:53,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 120 transitions. [2019-11-25 08:55:53,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:53,880 INFO L688 BuchiCegarLoop]: Abstraction has 100 states and 120 transitions. [2019-11-25 08:55:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 120 transitions. [2019-11-25 08:55:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-11-25 08:55:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-25 08:55:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-11-25 08:55:53,913 INFO L711 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-25 08:55:53,913 INFO L591 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-25 08:55:53,913 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:55:53,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 95 transitions. [2019-11-25 08:55:53,920 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 25 [2019-11-25 08:55:53,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:53,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:53,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:53,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:55:53,930 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 221#L-1 havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 222#L652 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 254#L564 foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 255#L564-1 foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 256#L641-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 257#L641-4 ldv_is_in_set_#res := 0; 261#L646 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 264#L655 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 237#L655-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 228#L641-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 229#L641-9 ldv_is_in_set_#res := 0; 235#L646-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 231#L622 assume 0 == ldv_set_add_#t~ret17;havoc ldv_set_add_#t~ret17;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 232#L564-2 ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;havoc ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 241#L578 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 242#L621 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 251#L641-13 [2019-11-25 08:55:53,931 INFO L796 eck$LassoCheckResult]: Loop: 251#L641-13 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 273#L642-2 assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 250#L641-12 call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 251#L641-13 [2019-11-25 08:55:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash -701059643, now seen corresponding path program 1 times [2019-11-25 08:55:53,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:53,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741534726] [2019-11-25 08:55:53,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:54,097 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:54,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:54,098 INFO L82 PathProgramCache]: Analyzing trace with hash 107407, now seen corresponding path program 1 times [2019-11-25 08:55:54,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:54,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603703] [2019-11-25 08:55:54,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:54,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:54,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:54,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1158213451, now seen corresponding path program 1 times [2019-11-25 08:55:54,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:54,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580518644] [2019-11-25 08:55:54,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:54,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580518644] [2019-11-25 08:55:54,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:54,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 08:55:54,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179270737] [2019-11-25 08:55:54,785 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-25 08:55:54,945 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 08:55:54,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:54,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:55:54,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:54,946 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. cyclomatic complexity: 23 Second operand 10 states. [2019-11-25 08:55:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:55,785 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2019-11-25 08:55:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:55:55,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 130 transitions. [2019-11-25 08:55:55,787 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 34 [2019-11-25 08:55:55,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 108 states and 130 transitions. [2019-11-25 08:55:55,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2019-11-25 08:55:55,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2019-11-25 08:55:55,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 130 transitions. [2019-11-25 08:55:55,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:55,791 INFO L688 BuchiCegarLoop]: Abstraction has 108 states and 130 transitions. [2019-11-25 08:55:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 130 transitions. [2019-11-25 08:55:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2019-11-25 08:55:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 08:55:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2019-11-25 08:55:55,797 INFO L711 BuchiCegarLoop]: Abstraction has 94 states and 114 transitions. [2019-11-25 08:55:55,797 INFO L591 BuchiCegarLoop]: Abstraction has 94 states and 114 transitions. [2019-11-25 08:55:55,798 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:55:55,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 114 transitions. [2019-11-25 08:55:55,799 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-11-25 08:55:55,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:55,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:55,800 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:55,800 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:55:55,800 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 431#L-1 havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 432#L652 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 462#L564 foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 463#L564-1 foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 464#L641-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 465#L641-4 ldv_is_in_set_#res := 0; 469#L646 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 473#L655 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 449#L655-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 439#L641-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 440#L641-9 ldv_is_in_set_#res := 0; 446#L646-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 442#L622 assume 0 == ldv_set_add_#t~ret17;havoc ldv_set_add_#t~ret17;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 443#L564-2 ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;havoc ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 452#L578 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 453#L621 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 486#L641-13 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 487#L641-14 ldv_is_in_set_#res := 0; 481#L646-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 489#L655-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 488#L655-5 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 436#L641-18 [2019-11-25 08:55:55,801 INFO L796 eck$LassoCheckResult]: Loop: 436#L641-18 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 482#L642-3 assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 435#L641-17 call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 436#L641-18 [2019-11-25 08:55:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash 644937291, now seen corresponding path program 1 times [2019-11-25 08:55:55,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:55,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053701318] [2019-11-25 08:55:55,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:55,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053701318] [2019-11-25 08:55:55,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:55,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:55:55,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140035021] [2019-11-25 08:55:55,902 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash 135211, now seen corresponding path program 1 times [2019-11-25 08:55:55,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:55,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245586066] [2019-11-25 08:55:55,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:55,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:56,125 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 08:55:56,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:55:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:56,127 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. cyclomatic complexity: 28 Second operand 8 states. [2019-11-25 08:55:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:56,765 INFO L93 Difference]: Finished difference Result 201 states and 245 transitions. [2019-11-25 08:55:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:55:56,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 245 transitions. [2019-11-25 08:55:56,768 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 78 [2019-11-25 08:55:56,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 201 states and 245 transitions. [2019-11-25 08:55:56,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2019-11-25 08:55:56,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-11-25 08:55:56,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 245 transitions. [2019-11-25 08:55:56,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:56,775 INFO L688 BuchiCegarLoop]: Abstraction has 201 states and 245 transitions. [2019-11-25 08:55:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 245 transitions. [2019-11-25 08:55:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 101. [2019-11-25 08:55:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-25 08:55:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-11-25 08:55:56,785 INFO L711 BuchiCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-11-25 08:55:56,785 INFO L591 BuchiCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-11-25 08:55:56,785 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:55:56,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 121 transitions. [2019-11-25 08:55:56,786 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 31 [2019-11-25 08:55:56,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:56,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:56,787 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:56,788 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:55:56,788 INFO L794 eck$LassoCheckResult]: Stem: 788#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 750#L-1 havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 751#L652 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 784#L564 foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 785#L564-1 foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 786#L641-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 787#L641-4 ldv_is_in_set_#res := 0; 791#L646 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 794#L655 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 769#L655-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 759#L641-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 760#L641-9 ldv_is_in_set_#res := 0; 767#L646-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 762#L622 assume 0 == ldv_set_add_#t~ret17;havoc ldv_set_add_#t~ret17;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 764#L564-2 ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;havoc ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 773#L578 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 738#L621 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 739#L641-13 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 752#L642-2 assume ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_#res := 1; 798#L646-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 799#L655-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 783#L655-5 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 757#L641-18 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 758#L642-3 [2019-11-25 08:55:56,788 INFO L796 eck$LassoCheckResult]: Loop: 758#L642-3 assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 755#L641-17 call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 756#L641-18 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 758#L642-3 [2019-11-25 08:55:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1431910219, now seen corresponding path program 1 times [2019-11-25 08:55:56,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:56,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531262075] [2019-11-25 08:55:56,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:56,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531262075] [2019-11-25 08:55:56,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:56,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:56,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878195764] [2019-11-25 08:55:56,836 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash 140071, now seen corresponding path program 2 times [2019-11-25 08:55:56,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:56,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004875722] [2019-11-25 08:55:56,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:56,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:56,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:56,950 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. cyclomatic complexity: 29 Second operand 4 states. [2019-11-25 08:55:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:57,001 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2019-11-25 08:55:57,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:55:57,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 115 transitions. [2019-11-25 08:55:57,003 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2019-11-25 08:55:57,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 91 states and 108 transitions. [2019-11-25 08:55:57,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2019-11-25 08:55:57,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-11-25 08:55:57,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 108 transitions. [2019-11-25 08:55:57,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:57,006 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 108 transitions. [2019-11-25 08:55:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 108 transitions. [2019-11-25 08:55:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-11-25 08:55:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-25 08:55:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-11-25 08:55:57,010 INFO L711 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-25 08:55:57,010 INFO L591 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-25 08:55:57,010 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:55:57,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 82 transitions. [2019-11-25 08:55:57,015 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 22 [2019-11-25 08:55:57,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:55:57,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:55:57,024 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-25 08:55:57,024 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:55:57,025 INFO L794 eck$LassoCheckResult]: Stem: 991#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 958#L-1 havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 959#L652 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 985#L564 foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 986#L564-1 foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 987#L641-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 988#L641-4 ldv_is_in_set_#res := 0; 992#L646 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 994#L655 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 972#L655-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 964#L641-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 965#L641-9 ldv_is_in_set_#res := 0; 971#L646-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 968#L622 assume !(0 == ldv_set_add_#t~ret17);havoc ldv_set_add_#t~ret17; 946#L621 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 947#L641-13 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 960#L641-14 ldv_is_in_set_#res := 0; 961#L646-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 980#L655-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 981#L655-5 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 962#L641-18 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 944#L641-19 ldv_is_in_set_#res := 0; 945#L646-3 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 973#L622-1 assume 0 == ldv_set_add_#t~ret17;havoc ldv_set_add_#t~ret17;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 975#L564-3 ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;havoc ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 982#L578-1 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 948#L621-1 mutex_unlock_#in~m.base, mutex_unlock_#in~m.offset := foo_~m2~0.base, foo_~m2~0.offset;havoc mutex_unlock_#t~ret28, mutex_unlock_~m.base, mutex_unlock_~m.offset;mutex_unlock_~m.base, mutex_unlock_~m.offset := mutex_unlock_#in~m.base, mutex_unlock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_unlock_~m.base, mutex_unlock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 949#L641-23 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 995#L642-4 [2019-11-25 08:55:57,025 INFO L796 eck$LassoCheckResult]: Loop: 995#L642-4 assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 952#L641-22 call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 953#L641-23 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 995#L642-4 [2019-11-25 08:55:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:57,025 INFO L82 PathProgramCache]: Analyzing trace with hash 108998346, now seen corresponding path program 1 times [2019-11-25 08:55:57,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:57,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316049709] [2019-11-25 08:55:57,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:57,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316049709] [2019-11-25 08:55:57,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:57,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:57,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675568423] [2019-11-25 08:55:57,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:55:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash 173833, now seen corresponding path program 1 times [2019-11-25 08:55:57,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:57,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356181288] [2019-11-25 08:55:57,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:57,077 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:57,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:57,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:57,193 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-25 08:55:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:57,213 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-11-25 08:55:57,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:55:57,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 13 transitions. [2019-11-25 08:55:57,214 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:55:57,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-11-25 08:55:57,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-25 08:55:57,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-25 08:55:57,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-25 08:55:57,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:55:57,214 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:55:57,214 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:55:57,215 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:55:57,215 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:55:57,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:55:57,215 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:55:57,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-25 08:55:57,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:55:57 BoogieIcfgContainer [2019-11-25 08:55:57,220 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:55:57,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:55:57,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:55:57,221 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:55:57,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:52" (3/4) ... [2019-11-25 08:55:57,225 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:55:57,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:55:57,226 INFO L168 Benchmark]: Toolchain (without parser) took 6139.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 944.8 MB in the beginning and 878.4 MB in the end (delta: 66.4 MB). Peak memory consumption was 196.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:57,227 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:57,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:57,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:57,229 INFO L168 Benchmark]: Boogie Preprocessor took 48.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:57,229 INFO L168 Benchmark]: RCFGBuilder took 792.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:57,230 INFO L168 Benchmark]: BuchiAutomizer took 4563.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 878.4 MB in the end (delta: 169.2 MB). Peak memory consumption was 169.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:57,230 INFO L168 Benchmark]: Witness Printer took 4.46 ms. Allocated memory is still 1.2 GB. Free memory is still 878.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:57,233 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 649.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 792.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4563.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 878.4 MB in the end (delta: 169.2 MB). Peak memory consumption was 169.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.46 ms. Allocated memory is still 1.2 GB. Free memory is still 878.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic). 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 1.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 156 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 101 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 257 SDtfs, 616 SDslu, 561 SDs, 0 SdLazy, 578 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...