./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 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y --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 869ef2ac3e655b6efbdfa5c05d637a0f622008da83d6042d15962fe695aee939 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 17:30:59,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 17:30:59,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 17:30:59,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 17:30:59,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 17:30:59,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 17:30:59,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 17:30:59,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 17:30:59,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 17:30:59,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 17:30:59,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 17:30:59,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 17:30:59,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 17:30:59,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 17:30:59,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 17:30:59,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 17:30:59,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 17:30:59,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 17:30:59,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 17:30:59,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 17:30:59,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 17:30:59,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 17:30:59,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 17:30:59,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 17:30:59,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 17:30:59,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 17:30:59,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 17:30:59,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 17:30:59,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 17:30:59,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 17:30:59,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 17:30:59,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 17:30:59,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 17:30:59,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 17:30:59,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 17:30:59,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 17:30:59,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 17:30:59,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 17:30:59,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 17:30:59,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 17:30:59,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 17:30:59,715 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-13 17:30:59,756 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 17:30:59,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 17:30:59,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 17:30:59,757 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 17:30:59,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 17:30:59,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 17:30:59,766 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 17:30:59,766 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-13 17:30:59,767 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-13 17:30:59,767 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-13 17:30:59,768 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-13 17:30:59,768 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-13 17:30:59,768 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-13 17:30:59,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 17:30:59,769 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 17:30:59,769 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-13 17:30:59,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 17:30:59,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 17:30:59,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 17:30:59,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-13 17:30:59,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-13 17:30:59,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-13 17:30:59,771 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 17:30:59,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 17:30:59,772 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-13 17:30:59,772 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 17:30:59,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-13 17:30:59,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 17:30:59,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 17:30:59,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 17:30:59,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 17:30:59,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 17:30:59,776 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-13 17:30:59,777 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y 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 -> 869ef2ac3e655b6efbdfa5c05d637a0f622008da83d6042d15962fe695aee939 [2021-11-13 17:31:00,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 17:31:00,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 17:31:00,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 17:31:00,118 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 17:31:00,120 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 17:31:00,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2021-11-13 17:31:00,194 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/data/2cf74986f/1ebccd9ce35844a2b964e46fef675a6e/FLAGd1f733c45 [2021-11-13 17:31:00,743 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 17:31:00,743 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2021-11-13 17:31:00,757 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/data/2cf74986f/1ebccd9ce35844a2b964e46fef675a6e/FLAGd1f733c45 [2021-11-13 17:31:01,013 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/data/2cf74986f/1ebccd9ce35844a2b964e46fef675a6e [2021-11-13 17:31:01,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 17:31:01,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 17:31:01,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 17:31:01,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 17:31:01,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 17:31:01,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58db17f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01, skipping insertion in model container [2021-11-13 17:31:01,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 17:31:01,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 17:31:01,432 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855] [2021-11-13 17:31:01,437 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980] [2021-11-13 17:31:01,439 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095] [2021-11-13 17:31:01,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:31:01,461 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 17:31:01,551 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855] [2021-11-13 17:31:01,553 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980] [2021-11-13 17:31:01,554 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095] [2021-11-13 17:31:01,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:31:01,592 INFO L208 MainTranslator]: Completed translation [2021-11-13 17:31:01,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01 WrapperNode [2021-11-13 17:31:01,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 17:31:01,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 17:31:01,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 17:31:01,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 17:31:01,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 17:31:01,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 17:31:01,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 17:31:01,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 17:31:01,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 17:31:01,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 17:31:01,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 17:31:01,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 17:31:01,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:31:01,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:01,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 17:31:01,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-13 17:31:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-13 17:31:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-13 17:31:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 17:31:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-13 17:31:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 17:31:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-13 17:31:01,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 17:31:01,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 17:31:01,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 17:31:02,750 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 17:31:02,751 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-13 17:31:02,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:31:02 BoogieIcfgContainer [2021-11-13 17:31:02,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 17:31:02,753 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-13 17:31:02,753 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-13 17:31:02,757 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-13 17:31:02,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 17:31:02,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 05:31:01" (1/3) ... [2021-11-13 17:31:02,763 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588aa76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 05:31:02, skipping insertion in model container [2021-11-13 17:31:02,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 17:31:02,763 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (2/3) ... [2021-11-13 17:31:02,763 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588aa76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 05:31:02, skipping insertion in model container [2021-11-13 17:31:02,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 17:31:02,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:31:02" (3/3) ... [2021-11-13 17:31:02,765 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_mutex_double_lock.i [2021-11-13 17:31:02,813 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-13 17:31:02,814 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-13 17:31:02,814 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-13 17:31:02,814 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-13 17:31:02,814 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-13 17:31:02,814 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-13 17:31:02,814 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-13 17:31:02,814 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-13 17:31:02,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 85 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:02,872 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2021-11-13 17:31:02,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:31:02,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:31:02,880 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:02,880 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 17:31:02,880 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-13 17:31:02,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 85 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:02,900 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2021-11-13 17:31:02,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:31:02,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:31:02,901 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:02,902 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 17:31:02,911 INFO L791 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string2.base, #t~string2.offset, 1);call write~init~int(0, #t~string2.base, 1 + #t~string2.offset, 1);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(12);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); 53#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset, foo_#t~ret33#1.base, foo_#t~ret33#1.offset, foo_~m1~0#1.base, foo_~m1~0#1.offset, foo_~m2~0#1.base, foo_~m2~0#1.offset;assume { :begin_inline_ldv_initialize } true; 12#L666true assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 23#L565true assume !(0 == assume_abort_if_not_~cond#1); 15#L564true assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 62#L578true foo_#t~ret32#1.base, foo_#t~ret32#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m1~0#1.base, foo_~m1~0#1.offset := foo_#t~ret32#1.base, foo_#t~ret32#1.offset;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 81#L565-2true assume !(0 == assume_abort_if_not_~cond#1); 4#L564-1true assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 64#L578-1true foo_#t~ret33#1.base, foo_#t~ret33#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m2~0#1.base, foo_~m2~0#1.offset := foo_#t~ret33#1.base, foo_#t~ret33#1.offset;havoc foo_#t~ret33#1.base, foo_#t~ret33#1.offset;assume { :begin_inline_mutex_lock } true;mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset := foo_~m1~0#1.base, foo_~m1~0#1.offset;havoc mutex_lock_#t~ret29#1, mutex_lock_~m#1.base, mutex_lock_~m#1.offset;mutex_lock_~m#1.base, mutex_lock_~m#1.offset := mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 66#L655-3true [2021-11-13 17:31:02,911 INFO L793 eck$LassoCheckResult]: Loop: 66#L655-3true assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 37#L656true assume !(ldv_is_in_set_#t~mem27#1.base == ldv_is_in_set_~e#1.base && ldv_is_in_set_#t~mem27#1.offset == ldv_is_in_set_~e#1.offset);havoc ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset; 48#L655-2true call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4; 66#L655-3true [2021-11-13 17:31:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1482586390, now seen corresponding path program 1 times [2021-11-13 17:31:02,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:02,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595822604] [2021-11-13 17:31:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:02,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:03,150 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:31:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:03,293 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:31:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:03,309 INFO L85 PathProgramCache]: Analyzing trace with hash 59743, now seen corresponding path program 1 times [2021-11-13 17:31:03,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:03,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758724685] [2021-11-13 17:31:03,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:03,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:03,336 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:31:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:03,369 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:31:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1712557526, now seen corresponding path program 1 times [2021-11-13 17:31:03,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:03,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896452244] [2021-11-13 17:31:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:03,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:03,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:03,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896452244] [2021-11-13 17:31:03,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896452244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:03,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:03,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:31:03,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113327395] [2021-11-13 17:31:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:03,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:03,802 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:04,090 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2021-11-13 17:31:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:31:04,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 171 transitions. [2021-11-13 17:31:04,101 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 38 [2021-11-13 17:31:04,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 121 states and 141 transitions. [2021-11-13 17:31:04,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-11-13 17:31:04,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-11-13 17:31:04,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 141 transitions. [2021-11-13 17:31:04,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:31:04,111 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2021-11-13 17:31:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 141 transitions. [2021-11-13 17:31:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 95. [2021-11-13 17:31:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.168421052631579) internal successors, (111), 94 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2021-11-13 17:31:04,153 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 111 transitions. [2021-11-13 17:31:04,153 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 111 transitions. [2021-11-13 17:31:04,153 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-13 17:31:04,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 111 transitions. [2021-11-13 17:31:04,154 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 25 [2021-11-13 17:31:04,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:31:04,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:31:04,156 INFO L842 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] [2021-11-13 17:31:04,156 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 17:31:04,157 INFO L791 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string2.base, #t~string2.offset, 1);call write~init~int(0, #t~string2.base, 1 + #t~string2.offset, 1);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(12);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); 311#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset, foo_#t~ret33#1.base, foo_#t~ret33#1.offset, foo_~m1~0#1.base, foo_~m1~0#1.offset, foo_~m2~0#1.base, foo_~m2~0#1.offset;assume { :begin_inline_ldv_initialize } true; 265#L666 assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 266#L565 assume !(0 == assume_abort_if_not_~cond#1); 269#L564 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 270#L578 foo_#t~ret32#1.base, foo_#t~ret32#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m1~0#1.base, foo_~m1~0#1.offset := foo_#t~ret32#1.base, foo_#t~ret32#1.offset;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 319#L565-2 assume !(0 == assume_abort_if_not_~cond#1); 250#L564-1 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 251#L578-1 foo_#t~ret33#1.base, foo_#t~ret33#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m2~0#1.base, foo_~m2~0#1.offset := foo_#t~ret33#1.base, foo_#t~ret33#1.offset;havoc foo_#t~ret33#1.base, foo_#t~ret33#1.offset;assume { :begin_inline_mutex_lock } true;mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset := foo_~m1~0#1.base, foo_~m1~0#1.offset;havoc mutex_lock_#t~ret29#1, mutex_lock_~m#1.base, mutex_lock_~m#1.offset;mutex_lock_~m#1.base, mutex_lock_~m#1.offset := mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 320#L655-3 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 307#L655-4 ldv_is_in_set_#res#1 := 0; 291#L660 mutex_lock_#t~ret29#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 292#L669 assume !(0 != mutex_lock_#t~ret29#1);havoc mutex_lock_#t~ret29#1; 316#L669-2 assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19#1, ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset := ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 301#L655-8 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 288#L655-9 ldv_is_in_set_#res#1 := 0; 289#L660-1 ldv_set_add_#t~ret19#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 293#L636 assume 0 == ldv_set_add_#t~ret19#1;havoc ldv_set_add_#t~ret19#1;havoc ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 12;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 290#L565-4 assume !(0 == assume_abort_if_not_~cond#1); 271#L564-2 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 272#L578-2 ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset := ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset;havoc ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset;call write~$Pointer$(ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, 4);assume { :begin_inline_ldv_list_add } true;ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset, ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset := ldv_set_add_~le~0#1.base, 4 + ldv_set_add_~le~0#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset, ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset;ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset := ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset;ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset := ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset;call ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset := read~$Pointer$(ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, 4);assume { :begin_inline___ldv_list_add } true;__ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset, __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset, __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset := ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset;havoc __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset;__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset := __ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset;__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset := __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset;__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset := __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset;call write~$Pointer$(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~next#1.base, 4 + __ldv_list_add_~next#1.offset, 4);call write~$Pointer$(__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset, __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, 4);call write~$Pointer$(__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~new#1.base, 4 + __ldv_list_add_~new#1.offset, 4);call write~$Pointer$(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, 4); 275#L592 assume { :end_inline___ldv_list_add } true;havoc ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset; 276#L606 assume { :end_inline_ldv_list_add } true; 277#L635 assume { :end_inline_ldv_set_add } true; 331#L668 assume { :end_inline_mutex_lock } true;assume { :begin_inline_mutex_lock } true;mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset := foo_~m1~0#1.base, foo_~m1~0#1.offset;havoc mutex_lock_#t~ret29#1, mutex_lock_~m#1.base, mutex_lock_~m#1.offset;mutex_lock_~m#1.base, mutex_lock_~m#1.offset := mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 255#L655-13 [2021-11-13 17:31:04,157 INFO L793 eck$LassoCheckResult]: Loop: 255#L655-13 assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 314#L656-2 assume !(ldv_is_in_set_#t~mem27#1.base == ldv_is_in_set_~e#1.base && ldv_is_in_set_#t~mem27#1.offset == ldv_is_in_set_~e#1.offset);havoc ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset; 254#L655-12 call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4; 255#L655-13 [2021-11-13 17:31:04,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:04,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1768300753, now seen corresponding path program 1 times [2021-11-13 17:31:04,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:04,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959792170] [2021-11-13 17:31:04,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:04,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:04,225 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:31:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:04,326 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:31:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash 130246, now seen corresponding path program 1 times [2021-11-13 17:31:04,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:04,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899863728] [2021-11-13 17:31:04,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:04,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:04,334 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:31:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:04,341 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:31:04,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:04,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1673746728, now seen corresponding path program 1 times [2021-11-13 17:31:04,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:04,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298493003] [2021-11-13 17:31:04,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:04,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:04,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:04,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298493003] [2021-11-13 17:31:04,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298493003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:04,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:04,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 17:31:04,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928956551] [2021-11-13 17:31:04,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:04,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-13 17:31:04,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-13 17:31:04,943 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. cyclomatic complexity: 23 Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:06,463 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2021-11-13 17:31:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-13 17:31:06,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 142 transitions. [2021-11-13 17:31:06,467 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2021-11-13 17:31:06,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 142 transitions. [2021-11-13 17:31:06,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2021-11-13 17:31:06,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2021-11-13 17:31:06,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 142 transitions. [2021-11-13 17:31:06,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:31:06,471 INFO L681 BuchiCegarLoop]: Abstraction has 123 states and 142 transitions. [2021-11-13 17:31:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 142 transitions. [2021-11-13 17:31:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 100. [2021-11-13 17:31:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.17) internal successors, (117), 99 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2021-11-13 17:31:06,479 INFO L704 BuchiCegarLoop]: Abstraction has 100 states and 117 transitions. [2021-11-13 17:31:06,479 INFO L587 BuchiCegarLoop]: Abstraction has 100 states and 117 transitions. [2021-11-13 17:31:06,479 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-13 17:31:06,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 117 transitions. [2021-11-13 17:31:06,481 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 22 [2021-11-13 17:31:06,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:31:06,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:31:06,482 INFO L842 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:06,482 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 17:31:06,483 INFO L791 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string2.base, #t~string2.offset, 1);call write~init~int(0, #t~string2.base, 1 + #t~string2.offset, 1);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(12);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); 559#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset, foo_#t~ret33#1.base, foo_#t~ret33#1.offset, foo_~m1~0#1.base, foo_~m1~0#1.offset, foo_~m2~0#1.base, foo_~m2~0#1.offset;assume { :begin_inline_ldv_initialize } true; 513#L666 assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 514#L565 assume !(0 == assume_abort_if_not_~cond#1); 517#L564 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 518#L578 foo_#t~ret32#1.base, foo_#t~ret32#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m1~0#1.base, foo_~m1~0#1.offset := foo_#t~ret32#1.base, foo_#t~ret32#1.offset;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 569#L565-2 assume !(0 == assume_abort_if_not_~cond#1); 502#L564-1 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 503#L578-1 foo_#t~ret33#1.base, foo_#t~ret33#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m2~0#1.base, foo_~m2~0#1.offset := foo_#t~ret33#1.base, foo_#t~ret33#1.offset;havoc foo_#t~ret33#1.base, foo_#t~ret33#1.offset;assume { :begin_inline_mutex_lock } true;mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset := foo_~m1~0#1.base, foo_~m1~0#1.offset;havoc mutex_lock_#t~ret29#1, mutex_lock_~m#1.base, mutex_lock_~m#1.offset;mutex_lock_~m#1.base, mutex_lock_~m#1.offset := mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 570#L655-3 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 556#L655-4 ldv_is_in_set_#res#1 := 0; 539#L660 mutex_lock_#t~ret29#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 540#L669 assume !(0 != mutex_lock_#t~ret29#1);havoc mutex_lock_#t~ret29#1; 566#L669-2 assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19#1, ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset := ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 549#L655-8 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 536#L655-9 ldv_is_in_set_#res#1 := 0; 537#L660-1 ldv_set_add_#t~ret19#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 541#L636 assume !(0 == ldv_set_add_#t~ret19#1);havoc ldv_set_add_#t~ret19#1; 534#L635 assume { :end_inline_ldv_set_add } true; 535#L668 assume { :end_inline_mutex_lock } true;assume { :begin_inline_mutex_lock } true;mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset := foo_~m1~0#1.base, foo_~m1~0#1.offset;havoc mutex_lock_#t~ret29#1, mutex_lock_~m#1.base, mutex_lock_~m#1.offset;mutex_lock_~m#1.base, mutex_lock_~m#1.offset := mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 506#L655-13 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 507#L655-14 ldv_is_in_set_#res#1 := 0; 504#L660-2 mutex_lock_#t~ret29#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 505#L669-3 assume !(0 != mutex_lock_#t~ret29#1);havoc mutex_lock_#t~ret29#1; 530#L669-5 assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19#1, ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset := ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 531#L655-18 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 557#L655-19 ldv_is_in_set_#res#1 := 0; 592#L660-3 ldv_set_add_#t~ret19#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 591#L636-2 assume !(0 == ldv_set_add_#t~ret19#1);havoc ldv_set_add_#t~ret19#1; 588#L635-1 assume { :end_inline_ldv_set_add } true; 574#L668-1 assume { :end_inline_mutex_lock } true;assume { :begin_inline_mutex_unlock } true;mutex_unlock_#in~m#1.base, mutex_unlock_#in~m#1.offset := foo_~m2~0#1.base, foo_~m2~0#1.offset;havoc mutex_unlock_#t~ret30#1, mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset;mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset := mutex_unlock_#in~m#1.base, mutex_unlock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 567#L655-23 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 545#L655-24 ldv_is_in_set_#res#1 := 0; 546#L660-4 mutex_unlock_#t~ret30#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 542#L673 assume !(0 == mutex_unlock_#t~ret30#1);havoc mutex_unlock_#t~ret30#1; 543#L673-2 assume { :begin_inline_ldv_set_del } true;ldv_set_del_#in~e#1.base, ldv_set_del_#in~e#1.offset, ldv_set_del_#in~s#1.base, ldv_set_del_#in~s#1.offset := mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_del_#t~mem21#1.base, ldv_set_del_#t~mem21#1.offset, ldv_set_del_~__mptr~0#1.base, ldv_set_del_~__mptr~0#1.offset, ldv_set_del_#t~mem22#1.base, ldv_set_del_#t~mem22#1.offset, ldv_set_del_~__mptr~1#1.base, ldv_set_del_~__mptr~1#1.offset, ldv_set_del_#t~mem24#1.base, ldv_set_del_#t~mem24#1.offset, ldv_set_del_#t~mem23#1.base, ldv_set_del_#t~mem23#1.offset, ldv_set_del_~__mptr~2#1.base, ldv_set_del_~__mptr~2#1.offset, ldv_set_del_~e#1.base, ldv_set_del_~e#1.offset, ldv_set_del_~s#1.base, ldv_set_del_~s#1.offset, ldv_set_del_~m~0#1.base, ldv_set_del_~m~0#1.offset, ldv_set_del_~n~0#1.base, ldv_set_del_~n~0#1.offset;ldv_set_del_~e#1.base, ldv_set_del_~e#1.offset := ldv_set_del_#in~e#1.base, ldv_set_del_#in~e#1.offset;ldv_set_del_~s#1.base, ldv_set_del_~s#1.offset := ldv_set_del_#in~s#1.base, ldv_set_del_#in~s#1.offset;havoc ldv_set_del_~m~0#1.base, ldv_set_del_~m~0#1.offset;havoc ldv_set_del_~n~0#1.base, ldv_set_del_~n~0#1.offset;call ldv_set_del_#t~mem21#1.base, ldv_set_del_#t~mem21#1.offset := read~$Pointer$(ldv_set_del_~s#1.base, ldv_set_del_~s#1.offset, 4);ldv_set_del_~__mptr~0#1.base, ldv_set_del_~__mptr~0#1.offset := ldv_set_del_#t~mem21#1.base, ldv_set_del_#t~mem21#1.offset;havoc ldv_set_del_#t~mem21#1.base, ldv_set_del_#t~mem21#1.offset;ldv_set_del_~m~0#1.base, ldv_set_del_~m~0#1.offset := ldv_set_del_~__mptr~0#1.base, ldv_set_del_~__mptr~0#1.offset - 4;call ldv_set_del_#t~mem22#1.base, ldv_set_del_#t~mem22#1.offset := read~$Pointer$(ldv_set_del_~m~0#1.base, 4 + ldv_set_del_~m~0#1.offset, 4);ldv_set_del_~__mptr~1#1.base, ldv_set_del_~__mptr~1#1.offset := ldv_set_del_#t~mem22#1.base, ldv_set_del_#t~mem22#1.offset;havoc ldv_set_del_#t~mem22#1.base, ldv_set_del_#t~mem22#1.offset;ldv_set_del_~n~0#1.base, ldv_set_del_~n~0#1.offset := ldv_set_del_~__mptr~1#1.base, ldv_set_del_~__mptr~1#1.offset - 4; 510#L646-3 [2021-11-13 17:31:06,484 INFO L793 eck$LassoCheckResult]: Loop: 510#L646-3 assume !!(ldv_set_del_~m~0#1.base != ldv_set_del_~s#1.base || 4 + ldv_set_del_~m~0#1.offset != ldv_set_del_~s#1.offset);call ldv_set_del_#t~mem24#1.base, ldv_set_del_#t~mem24#1.offset := read~$Pointer$(ldv_set_del_~m~0#1.base, ldv_set_del_~m~0#1.offset, 4); 512#L647 assume !(ldv_set_del_#t~mem24#1.base == ldv_set_del_~e#1.base && ldv_set_del_#t~mem24#1.offset == ldv_set_del_~e#1.offset);havoc ldv_set_del_#t~mem24#1.base, ldv_set_del_#t~mem24#1.offset; 544#L646-2 ldv_set_del_~m~0#1.base, ldv_set_del_~m~0#1.offset := ldv_set_del_~n~0#1.base, ldv_set_del_~n~0#1.offset;call ldv_set_del_#t~mem23#1.base, ldv_set_del_#t~mem23#1.offset := read~$Pointer$(ldv_set_del_~n~0#1.base, 4 + ldv_set_del_~n~0#1.offset, 4);ldv_set_del_~__mptr~2#1.base, ldv_set_del_~__mptr~2#1.offset := ldv_set_del_#t~mem23#1.base, ldv_set_del_#t~mem23#1.offset;havoc ldv_set_del_#t~mem23#1.base, ldv_set_del_#t~mem23#1.offset;ldv_set_del_~n~0#1.base, ldv_set_del_~n~0#1.offset := ldv_set_del_~__mptr~2#1.base, ldv_set_del_~__mptr~2#1.offset - 4; 510#L646-3 [2021-11-13 17:31:06,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1127351229, now seen corresponding path program 1 times [2021-11-13 17:31:06,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:06,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30641607] [2021-11-13 17:31:06,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:06,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:06,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:06,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30641607] [2021-11-13 17:31:06,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30641607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:06,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:06,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:31:06,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068093485] [2021-11-13 17:31:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:06,532 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 17:31:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 228681, now seen corresponding path program 1 times [2021-11-13 17:31:06,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:06,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940383231] [2021-11-13 17:31:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:06,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:06,539 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:31:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:06,545 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:31:06,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:06,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:06,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:06,703 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:06,765 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2021-11-13 17:31:06,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:31:06,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 129 transitions. [2021-11-13 17:31:06,772 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2021-11-13 17:31:06,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 129 transitions. [2021-11-13 17:31:06,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2021-11-13 17:31:06,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2021-11-13 17:31:06,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 129 transitions. [2021-11-13 17:31:06,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:31:06,775 INFO L681 BuchiCegarLoop]: Abstraction has 111 states and 129 transitions. [2021-11-13 17:31:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 129 transitions. [2021-11-13 17:31:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2021-11-13 17:31:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2021-11-13 17:31:06,781 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2021-11-13 17:31:06,781 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2021-11-13 17:31:06,781 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-13 17:31:06,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 91 transitions. [2021-11-13 17:31:06,782 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2021-11-13 17:31:06,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:31:06,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:31:06,783 INFO L842 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:06,783 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 17:31:06,784 INFO L791 eck$LassoCheckResult]: Stem: 791#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string2.base, #t~string2.offset, 1);call write~init~int(0, #t~string2.base, 1 + #t~string2.offset, 1);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(12);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); 780#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset, foo_#t~ret33#1.base, foo_#t~ret33#1.offset, foo_~m1~0#1.base, foo_~m1~0#1.offset, foo_~m2~0#1.base, foo_~m2~0#1.offset;assume { :begin_inline_ldv_initialize } true; 734#L666 assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 735#L565 assume !(0 == assume_abort_if_not_~cond#1); 738#L564 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 739#L578 foo_#t~ret32#1.base, foo_#t~ret32#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m1~0#1.base, foo_~m1~0#1.offset := foo_#t~ret32#1.base, foo_#t~ret32#1.offset;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 789#L565-2 assume !(0 == assume_abort_if_not_~cond#1); 722#L564-1 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 723#L578-1 foo_#t~ret33#1.base, foo_#t~ret33#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m2~0#1.base, foo_~m2~0#1.offset := foo_#t~ret33#1.base, foo_#t~ret33#1.offset;havoc foo_#t~ret33#1.base, foo_#t~ret33#1.offset;assume { :begin_inline_mutex_lock } true;mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset := foo_~m1~0#1.base, foo_~m1~0#1.offset;havoc mutex_lock_#t~ret29#1, mutex_lock_~m#1.base, mutex_lock_~m#1.offset;mutex_lock_~m#1.base, mutex_lock_~m#1.offset := mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 790#L655-3 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 776#L655-4 ldv_is_in_set_#res#1 := 0; 759#L660 mutex_lock_#t~ret29#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 760#L669 assume !(0 != mutex_lock_#t~ret29#1);havoc mutex_lock_#t~ret29#1; 786#L669-2 assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19#1, ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset := ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 770#L655-8 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 756#L655-9 ldv_is_in_set_#res#1 := 0; 757#L660-1 ldv_set_add_#t~ret19#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 761#L636 assume 0 == ldv_set_add_#t~ret19#1;havoc ldv_set_add_#t~ret19#1;havoc ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 12;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 758#L565-4 assume !(0 == assume_abort_if_not_~cond#1); 740#L564-2 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 741#L578-2 ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset := ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset;havoc ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset;call write~$Pointer$(ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, 4);assume { :begin_inline_ldv_list_add } true;ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset, ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset := ldv_set_add_~le~0#1.base, 4 + ldv_set_add_~le~0#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset, ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset;ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset := ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset;ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset := ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset;call ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset := read~$Pointer$(ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, 4);assume { :begin_inline___ldv_list_add } true;__ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset, __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset, __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset := ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset;havoc __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset;__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset := __ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset;__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset := __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset;__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset := __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset;call write~$Pointer$(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~next#1.base, 4 + __ldv_list_add_~next#1.offset, 4);call write~$Pointer$(__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset, __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, 4);call write~$Pointer$(__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~new#1.base, 4 + __ldv_list_add_~new#1.offset, 4);call write~$Pointer$(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, 4); 744#L592 assume { :end_inline___ldv_list_add } true;havoc ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset; 745#L606 assume { :end_inline_ldv_list_add } true; 746#L635 assume { :end_inline_ldv_set_add } true; 755#L668 assume { :end_inline_mutex_lock } true;assume { :begin_inline_mutex_lock } true;mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset := foo_~m1~0#1.base, foo_~m1~0#1.offset;havoc mutex_lock_#t~ret29#1, mutex_lock_~m#1.base, mutex_lock_~m#1.offset;mutex_lock_~m#1.base, mutex_lock_~m#1.offset := mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 726#L655-13 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 727#L655-14 ldv_is_in_set_#res#1 := 0; 724#L660-2 mutex_lock_#t~ret29#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 725#L669-3 assume !(0 != mutex_lock_#t~ret29#1);havoc mutex_lock_#t~ret29#1; 751#L669-5 assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19#1, ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset := ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 752#L655-18 assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 777#L656-3 assume ldv_is_in_set_#t~mem27#1.base == ldv_is_in_set_~e#1.base && ldv_is_in_set_#t~mem27#1.offset == ldv_is_in_set_~e#1.offset;havoc ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset;ldv_is_in_set_#res#1 := 1; 736#L660-3 ldv_set_add_#t~ret19#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 737#L636-2 assume !(0 == ldv_set_add_#t~ret19#1);havoc ldv_set_add_#t~ret19#1; 795#L635-1 assume { :end_inline_ldv_set_add } true; 792#L668-1 assume { :end_inline_mutex_lock } true;assume { :begin_inline_mutex_unlock } true;mutex_unlock_#in~m#1.base, mutex_unlock_#in~m#1.offset := foo_~m2~0#1.base, foo_~m2~0#1.offset;havoc mutex_unlock_#t~ret30#1, mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset;mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset := mutex_unlock_#in~m#1.base, mutex_unlock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 754#L655-23 [2021-11-13 17:31:06,786 INFO L793 eck$LassoCheckResult]: Loop: 754#L655-23 assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 787#L656-4 assume !(ldv_is_in_set_#t~mem27#1.base == ldv_is_in_set_~e#1.base && ldv_is_in_set_#t~mem27#1.offset == ldv_is_in_set_~e#1.offset);havoc ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset; 753#L655-22 call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4; 754#L655-23 [2021-11-13 17:31:06,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:06,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1369720751, now seen corresponding path program 1 times [2021-11-13 17:31:06,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:06,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318931211] [2021-11-13 17:31:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:06,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:06,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:06,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318931211] [2021-11-13 17:31:06,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318931211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:06,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:06,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 17:31:06,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663349803] [2021-11-13 17:31:06,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:06,944 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 17:31:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash 200749, now seen corresponding path program 1 times [2021-11-13 17:31:06,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:06,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640974635] [2021-11-13 17:31:06,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:06,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:06,951 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:31:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:06,956 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:31:07,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:07,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 17:31:07,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:07,095 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. cyclomatic complexity: 18 Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:07,636 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2021-11-13 17:31:07,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-13 17:31:07,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 132 transitions. [2021-11-13 17:31:07,639 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 38 [2021-11-13 17:31:07,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 132 transitions. [2021-11-13 17:31:07,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2021-11-13 17:31:07,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2021-11-13 17:31:07,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 132 transitions. [2021-11-13 17:31:07,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:31:07,642 INFO L681 BuchiCegarLoop]: Abstraction has 114 states and 132 transitions. [2021-11-13 17:31:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 132 transitions. [2021-11-13 17:31:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 75. [2021-11-13 17:31:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2021-11-13 17:31:07,648 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2021-11-13 17:31:07,648 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2021-11-13 17:31:07,648 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-13 17:31:07,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 85 transitions. [2021-11-13 17:31:07,649 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2021-11-13 17:31:07,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:31:07,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:31:07,650 INFO L842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:07,651 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 17:31:07,651 INFO L791 eck$LassoCheckResult]: Stem: 1011#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string2.base, #t~string2.offset, 1);call write~init~int(0, #t~string2.base, 1 + #t~string2.offset, 1);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(12);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); 1000#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset, foo_#t~ret33#1.base, foo_#t~ret33#1.offset, foo_~m1~0#1.base, foo_~m1~0#1.offset, foo_~m2~0#1.base, foo_~m2~0#1.offset;assume { :begin_inline_ldv_initialize } true; 955#L666 assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 956#L565 assume !(0 == assume_abort_if_not_~cond#1); 959#L564 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 960#L578 foo_#t~ret32#1.base, foo_#t~ret32#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m1~0#1.base, foo_~m1~0#1.offset := foo_#t~ret32#1.base, foo_#t~ret32#1.offset;havoc foo_#t~ret32#1.base, foo_#t~ret32#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 8;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1009#L565-2 assume !(0 == assume_abort_if_not_~cond#1); 944#L564-1 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 945#L578-1 foo_#t~ret33#1.base, foo_#t~ret33#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;foo_~m2~0#1.base, foo_~m2~0#1.offset := foo_#t~ret33#1.base, foo_#t~ret33#1.offset;havoc foo_#t~ret33#1.base, foo_#t~ret33#1.offset;assume { :begin_inline_mutex_lock } true;mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset := foo_~m1~0#1.base, foo_~m1~0#1.offset;havoc mutex_lock_#t~ret29#1, mutex_lock_~m#1.base, mutex_lock_~m#1.offset;mutex_lock_~m#1.base, mutex_lock_~m#1.offset := mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 1010#L655-3 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 997#L655-4 ldv_is_in_set_#res#1 := 0; 980#L660 mutex_lock_#t~ret29#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 981#L669 assume !(0 != mutex_lock_#t~ret29#1);havoc mutex_lock_#t~ret29#1; 1006#L669-2 assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19#1, ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset := ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 991#L655-8 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 977#L655-9 ldv_is_in_set_#res#1 := 0; 978#L660-1 ldv_set_add_#t~ret19#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 982#L636 assume 0 == ldv_set_add_#t~ret19#1;havoc ldv_set_add_#t~ret19#1;havoc ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 12;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;havoc ldv_successful_malloc_#t~malloc7#1.base, ldv_successful_malloc_#t~malloc7#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 979#L565-4 assume !(0 == assume_abort_if_not_~cond#1); 961#L564-2 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 962#L578-2 ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset := ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset;havoc ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset;call write~$Pointer$(ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, 4);assume { :begin_inline_ldv_list_add } true;ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset, ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset := ldv_set_add_~le~0#1.base, 4 + ldv_set_add_~le~0#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset, ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset;ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset := ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset;ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset := ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset;call ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset := read~$Pointer$(ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, 4);assume { :begin_inline___ldv_list_add } true;__ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset, __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset, __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset := ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset;havoc __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset;__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset := __ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset;__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset := __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset;__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset := __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset;call write~$Pointer$(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~next#1.base, 4 + __ldv_list_add_~next#1.offset, 4);call write~$Pointer$(__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset, __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, 4);call write~$Pointer$(__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~new#1.base, 4 + __ldv_list_add_~new#1.offset, 4);call write~$Pointer$(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, 4); 965#L592 assume { :end_inline___ldv_list_add } true;havoc ldv_list_add_#t~mem8#1.base, ldv_list_add_#t~mem8#1.offset; 966#L606 assume { :end_inline_ldv_list_add } true; 967#L635 assume { :end_inline_ldv_set_add } true; 976#L668 assume { :end_inline_mutex_lock } true;assume { :begin_inline_mutex_lock } true;mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset := foo_~m1~0#1.base, foo_~m1~0#1.offset;havoc mutex_lock_#t~ret29#1, mutex_lock_~m#1.base, mutex_lock_~m#1.offset;mutex_lock_~m#1.base, mutex_lock_~m#1.offset := mutex_lock_#in~m#1.base, mutex_lock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 948#L655-13 assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 949#L656-2 assume ldv_is_in_set_#t~mem27#1.base == ldv_is_in_set_~e#1.base && ldv_is_in_set_#t~mem27#1.offset == ldv_is_in_set_~e#1.offset;havoc ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset;ldv_is_in_set_#res#1 := 1; 946#L660-2 mutex_lock_#t~ret29#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 947#L669-3 assume !(0 != mutex_lock_#t~ret29#1);havoc mutex_lock_#t~ret29#1; 972#L669-5 assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := mutex_lock_~m#1.base, mutex_lock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19#1, ldv_set_add_#t~ret20#1.base, ldv_set_add_#t~ret20#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset := ldv_set_add_#in~new#1.base, ldv_set_add_#in~new#1.offset;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1.base, ldv_set_add_~new#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 973#L655-18 assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 998#L656-3 assume ldv_is_in_set_#t~mem27#1.base == ldv_is_in_set_~e#1.base && ldv_is_in_set_#t~mem27#1.offset == ldv_is_in_set_~e#1.offset;havoc ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset;ldv_is_in_set_#res#1 := 1; 957#L660-3 ldv_set_add_#t~ret19#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 958#L636-2 assume !(0 == ldv_set_add_#t~ret19#1);havoc ldv_set_add_#t~ret19#1; 994#L635-1 assume { :end_inline_ldv_set_add } true; 1012#L668-1 assume { :end_inline_mutex_lock } true;assume { :begin_inline_mutex_unlock } true;mutex_unlock_#in~m#1.base, mutex_unlock_#in~m#1.offset := foo_~m2~0#1.base, foo_~m2~0#1.offset;havoc mutex_unlock_#t~ret30#1, mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset;mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset := mutex_unlock_#in~m#1.base, mutex_unlock_#in~m#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := mutex_unlock_~m#1.base, mutex_unlock_~m#1.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset, ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1.base, ldv_is_in_set_~e#1.offset := ldv_is_in_set_#in~e#1.base, ldv_is_in_set_#in~e#1.offset;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;havoc ldv_is_in_set_#t~mem25#1.base, ldv_is_in_set_#t~mem25#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 1007#L655-23 assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 1008#L656-4 [2021-11-13 17:31:07,652 INFO L793 eck$LassoCheckResult]: Loop: 1008#L656-4 assume !(ldv_is_in_set_#t~mem27#1.base == ldv_is_in_set_~e#1.base && ldv_is_in_set_#t~mem27#1.offset == ldv_is_in_set_~e#1.offset);havoc ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset; 974#L655-22 call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4; 975#L655-23 assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem27#1.base, ldv_is_in_set_#t~mem27#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 1008#L656-4 [2021-11-13 17:31:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:07,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1260544915, now seen corresponding path program 1 times [2021-11-13 17:31:07,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:07,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128084308] [2021-11-13 17:31:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:07,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:07,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:07,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128084308] [2021-11-13 17:31:07,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128084308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:07,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:07,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:31:07,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231568628] [2021-11-13 17:31:07,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:07,740 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 17:31:07,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash 205609, now seen corresponding path program 2 times [2021-11-13 17:31:07,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:07,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003168005] [2021-11-13 17:31:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:07,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:07,749 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:31:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:07,757 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:31:07,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:07,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:07,917 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:31:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:07,939 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2021-11-13 17:31:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:31:07,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 28 transitions. [2021-11-13 17:31:07,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-11-13 17:31:07,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. [2021-11-13 17:31:07,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-11-13 17:31:07,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-11-13 17:31:07,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-11-13 17:31:07,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:31:07,941 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 17:31:07,941 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 17:31:07,941 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 17:31:07,941 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-13 17:31:07,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-11-13 17:31:07,941 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-11-13 17:31:07,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-11-13 17:31:07,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 05:31:07 BoogieIcfgContainer [2021-11-13 17:31:07,957 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-13 17:31:07,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 17:31:07,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 17:31:07,958 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 17:31:07,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:31:02" (3/4) ... [2021-11-13 17:31:07,962 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-13 17:31:07,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 17:31:07,964 INFO L158 Benchmark]: Toolchain (without parser) took 6946.51ms. Allocated memory was 113.2MB in the beginning and 157.3MB in the end (delta: 44.0MB). Free memory was 91.3MB in the beginning and 118.5MB in the end (delta: -27.2MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2021-11-13 17:31:07,970 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 86.0MB. Free memory was 59.9MB in the beginning and 59.8MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:31:07,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.35ms. Allocated memory is still 113.2MB. Free memory was 91.0MB in the beginning and 72.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-13 17:31:07,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.92ms. Allocated memory is still 113.2MB. Free memory was 72.4MB in the beginning and 69.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-13 17:31:07,972 INFO L158 Benchmark]: Boogie Preprocessor took 64.44ms. Allocated memory is still 113.2MB. Free memory was 69.3MB in the beginning and 65.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-13 17:31:07,972 INFO L158 Benchmark]: RCFGBuilder took 1020.75ms. Allocated memory is still 113.2MB. Free memory was 65.8MB in the beginning and 57.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-13 17:31:07,975 INFO L158 Benchmark]: BuchiAutomizer took 5203.98ms. Allocated memory was 113.2MB in the beginning and 157.3MB in the end (delta: 44.0MB). Free memory was 57.6MB in the beginning and 118.5MB in the end (delta: -60.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:31:07,976 INFO L158 Benchmark]: Witness Printer took 4.85ms. Allocated memory is still 157.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:31:07,982 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 86.0MB. Free memory was 59.9MB in the beginning and 59.8MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.35ms. Allocated memory is still 113.2MB. Free memory was 91.0MB in the beginning and 72.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.92ms. Allocated memory is still 113.2MB. Free memory was 72.4MB in the beginning and 69.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.44ms. Allocated memory is still 113.2MB. Free memory was 69.3MB in the beginning and 65.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1020.75ms. Allocated memory is still 113.2MB. Free memory was 65.8MB in the beginning and 57.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 5203.98ms. Allocated memory was 113.2MB in the beginning and 157.3MB in the end (delta: 44.0MB). Free memory was 57.6MB in the beginning and 118.5MB in the end (delta: -60.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.85ms. Allocated memory is still 157.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * 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 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 1.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 121 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 100 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 913 SdHoareTripleChecker+Valid, 1639.11ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 913 mSDsluCounter, 1044 SdHoareTripleChecker+Invalid, 1411.03ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 749 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 660 IncrementalHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 295 mSDtfsCounter, 660 mSolverCounterSat, 23.23ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown 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! [2021-11-13 17:31:08,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9da1834-c40f-495f-9894-218f7ca7fdc5/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE