./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/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 ad29ac750d7eee43ee0f4c2b7f90b5e7c26b142d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 07:00:52,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:00:52,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:00:52,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:00:52,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:00:52,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:00:52,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:00:52,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:00:52,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:00:52,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:00:52,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:00:52,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:00:52,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:00:52,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:00:52,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:00:52,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:00:52,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:00:52,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:00:52,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:00:52,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:00:52,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:00:52,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:00:52,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:00:52,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:00:52,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:00:52,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:00:52,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:00:52,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:00:52,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:00:52,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:00:52,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:00:52,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:00:52,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:00:52,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:00:52,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:00:52,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:00:52,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:00:52,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:00:52,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:00:52,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:00:52,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:00:52,975 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 07:00:53,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:00:53,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:00:53,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:00:53,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:00:53,012 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:00:53,013 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 07:00:53,013 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 07:00:53,013 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 07:00:53,013 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 07:00:53,014 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 07:00:53,014 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 07:00:53,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:00:53,017 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:00:53,017 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 07:00:53,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:00:53,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:00:53,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:00:53,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 07:00:53,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 07:00:53,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 07:00:53,019 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:00:53,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:00:53,019 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 07:00:53,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:00:53,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 07:00:53,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:00:53,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:00:53,021 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 07:00:53,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:00:53,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:00:53,021 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 07:00:53,022 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 07:00:53,022 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_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/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 -> ad29ac750d7eee43ee0f4c2b7f90b5e7c26b142d [2019-11-20 07:00:53,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:00:53,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:00:53,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:00:53,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:00:53,186 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:00:53,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2019-11-20 07:00:53,239 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/data/5fcf6a8dd/6d100a71212c4345b0c1cd1535e1dc31/FLAG3913b51d9 [2019-11-20 07:00:53,703 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:00:53,704 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2019-11-20 07:00:53,718 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/data/5fcf6a8dd/6d100a71212c4345b0c1cd1535e1dc31/FLAG3913b51d9 [2019-11-20 07:00:53,731 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/bin/uautomizer/data/5fcf6a8dd/6d100a71212c4345b0c1cd1535e1dc31 [2019-11-20 07:00:53,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:00:53,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:00:53,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:00:53,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:00:53,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:00:53,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:00:53" (1/1) ... [2019-11-20 07:00:53,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189ca1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:53, skipping insertion in model container [2019-11-20 07:00:53,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:00:53" (1/1) ... [2019-11-20 07:00:53,751 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:00:53,812 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:00:54,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:00:54,196 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:00:54,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:00:54,294 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:00:54,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54 WrapperNode [2019-11-20 07:00:54,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:00:54,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:00:54,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:00:54,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:00:54,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... [2019-11-20 07:00:54,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... [2019-11-20 07:00:54,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:00:54,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:00:54,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:00:54,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:00:54,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... [2019-11-20 07:00:54,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... [2019-11-20 07:00:54,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... [2019-11-20 07:00:54,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... [2019-11-20 07:00:54,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... [2019-11-20 07:00:54,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... [2019-11-20 07:00:54,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... [2019-11-20 07:00:54,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:00:54,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:00:54,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:00:54,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:00:54,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd095fb3-5c87-4d0b-9fda-ebf0df9b0468/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-20 07:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 07:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 07:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 07:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 07:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 07:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 07:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:00:54,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:00:55,122 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:00:55,123 INFO L285 CfgBuilder]: Removed 74 assume(true) statements. [2019-11-20 07:00:55,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:55 BoogieIcfgContainer [2019-11-20 07:00:55,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:00:55,124 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 07:00:55,125 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 07:00:55,128 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 07:00:55,131 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 07:00:55,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 07:00:53" (1/3) ... [2019-11-20 07:00:55,132 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@178ec103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 07:00:55, skipping insertion in model container [2019-11-20 07:00:55,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 07:00:55,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:54" (2/3) ... [2019-11-20 07:00:55,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@178ec103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 07:00:55, skipping insertion in model container [2019-11-20 07:00:55,133 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 07:00:55,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:55" (3/3) ... [2019-11-20 07:00:55,136 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_mutex_double_lock.i [2019-11-20 07:00:55,174 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 07:00:55,174 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 07:00:55,174 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 07:00:55,174 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:00:55,174 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:00:55,175 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 07:00:55,175 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:00:55,175 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 07:00:55,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-11-20 07:00:55,225 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-11-20 07:00:55,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:00:55,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:00:55,230 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 07:00:55,230 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:00:55,230 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 07:00:55,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-11-20 07:00:55,237 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-11-20 07:00:55,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:00:55,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:00:55,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 07:00:55,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:00:55,244 INFO L794 eck$LassoCheckResult]: Stem: 35#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); 14#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; 68#L653true 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; 70#L565true 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; 54#L565-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; 71#L642-3true [2019-11-20 07:00:55,244 INFO L796 eck$LassoCheckResult]: Loop: 71#L642-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); 4#L643true 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; 69#L642-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; 71#L642-3true [2019-11-20 07:00:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash 28692771, now seen corresponding path program 1 times [2019-11-20 07:00:55,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:55,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735524259] [2019-11-20 07:00:55,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:55,411 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:00:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:55,412 INFO L82 PathProgramCache]: Analyzing trace with hash 45841, now seen corresponding path program 1 times [2019-11-20 07:00:55,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:55,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016186986] [2019-11-20 07:00:55,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:55,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:00:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash 87865007, now seen corresponding path program 1 times [2019-11-20 07:00:55,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:55,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113830219] [2019-11-20 07:00:55,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:00:55,537 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-20 07:00:55,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113830219] [2019-11-20 07:00:55,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:00:55,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:00:55,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833557567] [2019-11-20 07:00:55,648 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-20 07:00:55,813 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 07:00:55,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:00:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:00:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:00:55,832 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-11-20 07:00:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:00:56,098 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-11-20 07:00:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:00:56,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-11-20 07:00:56,107 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 38 [2019-11-20 07:00:56,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 100 states and 120 transitions. [2019-11-20 07:00:56,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-11-20 07:00:56,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-11-20 07:00:56,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 120 transitions. [2019-11-20 07:00:56,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:00:56,116 INFO L688 BuchiCegarLoop]: Abstraction has 100 states and 120 transitions. [2019-11-20 07:00:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 120 transitions. [2019-11-20 07:00:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-11-20 07:00:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-20 07:00:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-11-20 07:00:56,145 INFO L711 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-20 07:00:56,145 INFO L591 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-20 07:00:56,146 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 07:00:56,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 95 transitions. [2019-11-20 07:00:56,147 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 25 [2019-11-20 07:00:56,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:00:56,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:00:56,148 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-20 07:00:56,149 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:00:56,149 INFO L794 eck$LassoCheckResult]: Stem: 253#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); 226#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; 227#L653 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; 277#L565 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; 270#L565-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; 271#L642-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); 273#L642-4 ldv_is_in_set_#res := 0; 231#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 232#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 258#L656-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; 259#L642-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); 257#L642-9 ldv_is_in_set_#res := 0; 235#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 236#L623 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; 274#L565-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); 263#L579 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 264#L622 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; 268#L642-13 [2019-11-20 07:00:56,150 INFO L796 eck$LassoCheckResult]: Loop: 268#L642-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); 216#L643-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; 218#L642-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; 268#L642-13 [2019-11-20 07:00:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash -701059643, now seen corresponding path program 1 times [2019-11-20 07:00:56,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:56,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680661546] [2019-11-20 07:00:56,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:56,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:00:56,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:56,319 INFO L82 PathProgramCache]: Analyzing trace with hash 107407, now seen corresponding path program 1 times [2019-11-20 07:00:56,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:56,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498930433] [2019-11-20 07:00:56,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:56,332 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:00:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:56,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1158213451, now seen corresponding path program 1 times [2019-11-20 07:00:56,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:56,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272597016] [2019-11-20 07:00:56,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:00:56,845 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-20 07:00:56,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272597016] [2019-11-20 07:00:56,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:00:56,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 07:00:56,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381420478] [2019-11-20 07:00:57,091 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 07:00:57,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:00:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 07:00:57,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 07:00:57,093 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. cyclomatic complexity: 23 Second operand 10 states. [2019-11-20 07:00:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:00:57,755 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2019-11-20 07:00:57,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:00:57,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 130 transitions. [2019-11-20 07:00:57,758 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 34 [2019-11-20 07:00:57,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 108 states and 130 transitions. [2019-11-20 07:00:57,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2019-11-20 07:00:57,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2019-11-20 07:00:57,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 130 transitions. [2019-11-20 07:00:57,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:00:57,762 INFO L688 BuchiCegarLoop]: Abstraction has 108 states and 130 transitions. [2019-11-20 07:00:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 130 transitions. [2019-11-20 07:00:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2019-11-20 07:00:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-20 07:00:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2019-11-20 07:00:57,769 INFO L711 BuchiCegarLoop]: Abstraction has 94 states and 114 transitions. [2019-11-20 07:00:57,769 INFO L591 BuchiCegarLoop]: Abstraction has 94 states and 114 transitions. [2019-11-20 07:00:57,769 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 07:00:57,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 114 transitions. [2019-11-20 07:00:57,770 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-11-20 07:00:57,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:00:57,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:00:57,772 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-20 07:00:57,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:00:57,772 INFO L794 eck$LassoCheckResult]: Stem: 461#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); 434#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; 435#L653 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; 486#L565 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; 479#L565-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; 480#L642-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); 483#L642-4 ldv_is_in_set_#res := 0; 439#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 440#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 468#L656-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; 469#L642-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); 466#L642-9 ldv_is_in_set_#res := 0; 443#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 444#L623 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; 484#L565-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); 472#L579 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 473#L622 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; 488#L642-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); 489#L642-14 ldv_is_in_set_#res := 0; 427#L647-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 474#L656-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 475#L656-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; 462#L642-18 [2019-11-20 07:00:57,773 INFO L796 eck$LassoCheckResult]: Loop: 462#L642-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); 430#L643-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; 431#L642-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; 462#L642-18 [2019-11-20 07:00:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash 644937291, now seen corresponding path program 1 times [2019-11-20 07:00:57,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:57,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094064393] [2019-11-20 07:00:57,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:00:57,973 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-20 07:00:57,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094064393] [2019-11-20 07:00:57,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:00:57,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 07:00:57,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261856844] [2019-11-20 07:00:57,975 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:00:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash 135211, now seen corresponding path program 1 times [2019-11-20 07:00:57,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:57,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040590258] [2019-11-20 07:00:57,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:57,983 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:00:58,165 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 07:00:58,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:00:58,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:00:58,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:00:58,167 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. cyclomatic complexity: 28 Second operand 8 states. [2019-11-20 07:00:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:00:58,749 INFO L93 Difference]: Finished difference Result 201 states and 245 transitions. [2019-11-20 07:00:58,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 07:00:58,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 245 transitions. [2019-11-20 07:00:58,753 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 78 [2019-11-20 07:00:58,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 201 states and 245 transitions. [2019-11-20 07:00:58,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2019-11-20 07:00:58,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-11-20 07:00:58,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 245 transitions. [2019-11-20 07:00:58,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:00:58,760 INFO L688 BuchiCegarLoop]: Abstraction has 201 states and 245 transitions. [2019-11-20 07:00:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 245 transitions. [2019-11-20 07:00:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 101. [2019-11-20 07:00:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 07:00:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-11-20 07:00:58,770 INFO L711 BuchiCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-11-20 07:00:58,770 INFO L591 BuchiCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-11-20 07:00:58,770 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 07:00:58,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 121 transitions. [2019-11-20 07:00:58,771 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 31 [2019-11-20 07:00:58,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:00:58,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:00:58,772 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-20 07:00:58,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:00:58,773 INFO L794 eck$LassoCheckResult]: Stem: 782#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); 752#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; 753#L653 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; 807#L565 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; 798#L565-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; 799#L642-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); 801#L642-4 ldv_is_in_set_#res := 0; 757#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 758#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 787#L656-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; 788#L642-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); 786#L642-9 ldv_is_in_set_#res := 0; 761#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 762#L623 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; 802#L565-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); 790#L579 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 791#L622 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; 809#L642-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); 744#L643-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; 745#L647-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 765#L656-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 797#L656-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; 784#L642-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); 748#L643-3 [2019-11-20 07:00:58,773 INFO L796 eck$LassoCheckResult]: Loop: 748#L643-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; 749#L642-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; 783#L642-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); 748#L643-3 [2019-11-20 07:00:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1431910219, now seen corresponding path program 1 times [2019-11-20 07:00:58,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:58,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883859060] [2019-11-20 07:00:58,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:00:58,848 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-20 07:00:58,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883859060] [2019-11-20 07:00:58,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:00:58,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:00:58,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707289828] [2019-11-20 07:00:58,850 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:00:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash 140071, now seen corresponding path program 2 times [2019-11-20 07:00:58,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:58,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109804730] [2019-11-20 07:00:58,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:58,859 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:00:58,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:00:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:00:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:00:58,983 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. cyclomatic complexity: 29 Second operand 4 states. [2019-11-20 07:00:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:00:59,028 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2019-11-20 07:00:59,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:00:59,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 115 transitions. [2019-11-20 07:00:59,030 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2019-11-20 07:00:59,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 91 states and 108 transitions. [2019-11-20 07:00:59,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2019-11-20 07:00:59,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-11-20 07:00:59,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 108 transitions. [2019-11-20 07:00:59,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:00:59,033 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 108 transitions. [2019-11-20 07:00:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 108 transitions. [2019-11-20 07:00:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-11-20 07:00:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-20 07:00:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-11-20 07:00:59,037 INFO L711 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-20 07:00:59,037 INFO L591 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-20 07:00:59,037 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 07:00:59,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 82 transitions. [2019-11-20 07:00:59,038 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 22 [2019-11-20 07:00:59,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:00:59,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:00:59,039 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-20 07:00:59,039 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:00:59,040 INFO L794 eck$LassoCheckResult]: Stem: 983#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); 956#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; 957#L653 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; 1000#L565 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; 996#L565-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; 997#L642-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); 998#L642-4 ldv_is_in_set_#res := 0; 963#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 964#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 988#L656-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; 989#L642-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); 987#L642-9 ldv_is_in_set_#res := 0; 967#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 968#L623 assume !(0 == ldv_set_add_#t~ret17);havoc ldv_set_add_#t~ret17; 971#L622 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; 972#L642-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); 982#L642-14 ldv_is_in_set_#res := 0; 969#L647-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 970#L656-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 991#L656-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; 984#L642-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); 985#L642-19 ldv_is_in_set_#res := 0; 944#L647-3 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 945#L623-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; 990#L565-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); 992#L579-1 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 993#L622-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; 1007#L642-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); 954#L643-4 [2019-11-20 07:00:59,040 INFO L796 eck$LassoCheckResult]: Loop: 954#L643-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; 955#L642-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; 977#L642-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); 954#L643-4 [2019-11-20 07:00:59,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:59,041 INFO L82 PathProgramCache]: Analyzing trace with hash 108998346, now seen corresponding path program 1 times [2019-11-20 07:00:59,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:59,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254734400] [2019-11-20 07:00:59,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:00:59,101 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-20 07:00:59,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254734400] [2019-11-20 07:00:59,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:00:59,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:00:59,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178184256] [2019-11-20 07:00:59,103 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:00:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:00:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash 173833, now seen corresponding path program 1 times [2019-11-20 07:00:59,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:00:59,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441241661] [2019-11-20 07:00:59,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:00:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:00:59,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:00:59,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:00:59,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:00:59,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:00:59,221 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-20 07:00:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:00:59,242 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-11-20 07:00:59,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:00:59,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 13 transitions. [2019-11-20 07:00:59,243 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 07:00:59,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-11-20 07:00:59,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 07:00:59,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 07:00:59,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 07:00:59,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:00:59,244 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 07:00:59,244 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 07:00:59,244 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 07:00:59,244 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 07:00:59,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 07:00:59,244 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 07:00:59,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 07:00:59,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 07:00:59 BoogieIcfgContainer [2019-11-20 07:00:59,249 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 07:00:59,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:00:59,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:00:59,250 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:00:59,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:55" (3/4) ... [2019-11-20 07:00:59,254 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 07:00:59,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:00:59,257 INFO L168 Benchmark]: Toolchain (without parser) took 5521.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 940.7 MB in the beginning and 1.0 GB in the end (delta: -98.3 MB). Peak memory consumption was 126.1 MB. Max. memory is 11.5 GB. [2019-11-20 07:00:59,257 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:00:59,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-20 07:00:59,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.45 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:00:59,264 INFO L168 Benchmark]: Boogie Preprocessor took 50.98 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-20 07:00:59,265 INFO L168 Benchmark]: RCFGBuilder took 719.97 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: 61.8 MB). Peak memory consumption was 61.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:00:59,265 INFO L168 Benchmark]: BuchiAutomizer took 4124.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.2 MB). Peak memory consumption was 92.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:00:59,266 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:00:59,275 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 559.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.45 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.98 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 719.97 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: 61.8 MB). Peak memory consumption was 61.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4124.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.2 MB). Peak memory consumption was 92.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. 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.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.9s. Büchi inclusion checks took 0.6s. 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, 0.9s 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...