./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 b2eff8ba
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/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_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg --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
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE
--- Real Ultimate output ---
This is Ultimate 0.2.1-dev-b2eff8b
[2021-10-28 08:40:11,445 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-10-28 08:40:11,449 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-28 08:40:11,517 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-28 08:40:11,518 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-28 08:40:11,523 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-28 08:40:11,525 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-28 08:40:11,530 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-28 08:40:11,533 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-28 08:40:11,542 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-28 08:40:11,544 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-10-28 08:40:11,546 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-28 08:40:11,547 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-28 08:40:11,550 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-28 08:40:11,553 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-28 08:40:11,560 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-28 08:40:11,566 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-28 08:40:11,568 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-28 08:40:11,571 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-28 08:40:11,582 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-28 08:40:11,584 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-28 08:40:11,586 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-28 08:40:11,590 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-10-28 08:40:11,592 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-28 08:40:11,603 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-28 08:40:11,603 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-28 08:40:11,604 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-28 08:40:11,607 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-28 08:40:11,608 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-28 08:40:11,610 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-28 08:40:11,611 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-28 08:40:11,612 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-28 08:40:11,614 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-28 08:40:11,616 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-28 08:40:11,619 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-28 08:40:11,619 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-28 08:40:11,620 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-28 08:40:11,620 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-28 08:40:11,621 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-28 08:40:11,622 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-28 08:40:11,623 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-10-28 08:40:11,624 INFO  L101        SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf
[2021-10-28 08:40:11,688 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-10-28 08:40:11,691 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-28 08:40:11,692 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-10-28 08:40:11,692 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-10-28 08:40:11,694 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-28 08:40:11,694 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-10-28 08:40:11,695 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-10-28 08:40:11,695 INFO  L136        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2021-10-28 08:40:11,695 INFO  L138        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2021-10-28 08:40:11,696 INFO  L138        SettingsManager]:  * Use old map elimination=false
[2021-10-28 08:40:11,697 INFO  L138        SettingsManager]:  * Use external solver (rank synthesis)=false
[2021-10-28 08:40:11,698 INFO  L138        SettingsManager]:  * Use only trivial implications for array writes=true
[2021-10-28 08:40:11,698 INFO  L138        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2021-10-28 08:40:11,698 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-28 08:40:11,699 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-10-28 08:40:11,699 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2021-10-28 08:40:11,699 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-10-28 08:40:11,699 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-10-28 08:40:11,700 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-10-28 08:40:11,700 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2021-10-28 08:40:11,700 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2021-10-28 08:40:11,701 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2021-10-28 08:40:11,701 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-10-28 08:40:11,701 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-10-28 08:40:11,702 INFO  L138        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2021-10-28 08:40:11,702 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-10-28 08:40:11,705 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2021-10-28 08:40:11,705 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-28 08:40:11,706 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-10-28 08:40:11,706 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-28 08:40:11,706 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-10-28 08:40:11,707 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-10-28 08:40:11,709 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2021-10-28 08:40:11,709 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_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/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_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg
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-10-28 08:40:12,098 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-28 08:40:12,125 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-28 08:40:12,128 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-28 08:40:12,130 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-10-28 08:40:12,131 INFO  L275        PluginConnector]: CDTParser initialized
[2021-10-28 08:40:12,132 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i
[2021-10-28 08:40:12,221 INFO  L220              CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/data/0e43a0ea1/70ab03981ab64ce592617f16d0054cd3/FLAG18725cb41
[2021-10-28 08:40:12,931 INFO  L306              CDTParser]: Found 1 translation units.
[2021-10-28 08:40:12,932 INFO  L160              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i
[2021-10-28 08:40:12,949 INFO  L349              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/data/0e43a0ea1/70ab03981ab64ce592617f16d0054cd3/FLAG18725cb41
[2021-10-28 08:40:13,134 INFO  L357              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/data/0e43a0ea1/70ab03981ab64ce592617f16d0054cd3
[2021-10-28 08:40:13,137 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-28 08:40:13,139 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-28 08:40:13,141 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-28 08:40:13,142 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-28 08:40:13,154 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-28 08:40:13,155 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:13,157 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e254db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13, skipping insertion in model container
[2021-10-28 08:40:13,157 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:13,167 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-10-28 08:40:13,218 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-10-28 08:40:13,621 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_88cd2cff-2fe6-4e91-b718-921b4f0064dd/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855]
[2021-10-28 08:40:13,624 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_88cd2cff-2fe6-4e91-b718-921b4f0064dd/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980]
[2021-10-28 08:40:13,626 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_88cd2cff-2fe6-4e91-b718-921b4f0064dd/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095]
[2021-10-28 08:40:13,631 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-28 08:40:13,642 INFO  L203         MainTranslator]: Completed pre-run
[2021-10-28 08:40:13,757 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_88cd2cff-2fe6-4e91-b718-921b4f0064dd/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855]
[2021-10-28 08:40:13,763 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_88cd2cff-2fe6-4e91-b718-921b4f0064dd/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980]
[2021-10-28 08:40:13,777 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_88cd2cff-2fe6-4e91-b718-921b4f0064dd/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095]
[2021-10-28 08:40:13,780 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-28 08:40:13,839 INFO  L208         MainTranslator]: Completed translation
[2021-10-28 08:40:13,840 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13 WrapperNode
[2021-10-28 08:40:13,841 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-28 08:40:13,842 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-28 08:40:13,843 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-28 08:40:13,843 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-28 08:40:13,852 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:13,873 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:13,933 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-28 08:40:13,934 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-28 08:40:13,935 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-28 08:40:13,935 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-10-28 08:40:13,953 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:13,954 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:13,964 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:13,969 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:14,012 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:14,021 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:14,025 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:14,033 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-28 08:40:14,034 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-28 08:40:14,034 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-10-28 08:40:14,035 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-10-28 08:40:14,036 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (1/1) ...
[2021-10-28 08:40:14,063 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 08:40:14,079 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/z3
[2021-10-28 08:40:14,095 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 08:40:14,116 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2021-10-28 08:40:14,160 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2021-10-28 08:40:14,160 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2021-10-28 08:40:14,161 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-28 08:40:14,161 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2021-10-28 08:40:14,161 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-28 08:40:14,162 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2021-10-28 08:40:14,162 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-28 08:40:14,162 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-28 08:40:14,162 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-28 08:40:15,178 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-28 08:40:15,179 INFO  L299             CfgBuilder]: Removed 82 assume(true) statements.
[2021-10-28 08:40:15,181 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:40:15 BoogieIcfgContainer
[2021-10-28 08:40:15,182 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-28 08:40:15,183 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2021-10-28 08:40:15,183 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2021-10-28 08:40:15,188 INFO  L275        PluginConnector]: BuchiAutomizer initialized
[2021-10-28 08:40:15,189 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-28 08:40:15,189 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 08:40:13" (1/3) ...
[2021-10-28 08:40:15,191 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@651694e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 08:40:15, skipping insertion in model container
[2021-10-28 08:40:15,191 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-28 08:40:15,192 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:40:13" (2/3) ...
[2021-10-28 08:40:15,192 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@651694e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 08:40:15, skipping insertion in model container
[2021-10-28 08:40:15,192 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-28 08:40:15,193 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:40:15" (3/3) ...
[2021-10-28 08:40:15,194 INFO  L389   chiAutomizerObserver]: Analyzing ICFG test_mutex_double_lock.i
[2021-10-28 08:40:15,249 INFO  L359         BuchiCegarLoop]: Interprodecural is true
[2021-10-28 08:40:15,249 INFO  L360         BuchiCegarLoop]: Hoare is false
[2021-10-28 08:40:15,249 INFO  L361         BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2021-10-28 08:40:15,250 INFO  L362         BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-28 08:40:15,250 INFO  L363         BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-28 08:40:15,250 INFO  L364         BuchiCegarLoop]: Difference is false
[2021-10-28 08:40:15,250 INFO  L365         BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-28 08:40:15,250 INFO  L368         BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2021-10-28 08:40:15,272 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 78 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 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-10-28 08:40:15,303 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 28
[2021-10-28 08:40:15,303 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 08:40:15,303 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 08:40:15,312 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 08:40:15,312 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2021-10-28 08:40:15,312 INFO  L425         BuchiCegarLoop]: ======== Iteration 1============
[2021-10-28 08:40:15,313 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 78 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 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-10-28 08:40:15,323 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 28
[2021-10-28 08:40:15,323 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 08:40:15,323 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 08:40:15,324 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 08:40:15,324 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2021-10-28 08:40:15,333 INFO  L791   eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRYtrue #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); 50#L-1true havoc main_#res;havoc foo_#t~ret32.base, foo_#t~ret32.offset, foo_#t~ret33.base, foo_#t~ret33.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 12#L666true ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 22#L565true assume !(0 == assume_abort_if_not_~cond); 15#L564true ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 58#L578true foo_#t~ret32.base, foo_#t~ret32.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret32.base, foo_#t~ret32.offset;havoc foo_#t~ret32.base, foo_#t~ret32.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 76#L565-2true assume !(0 == assume_abort_if_not_~cond); 4#L564-1true ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 60#L578-1true foo_#t~ret33.base, foo_#t~ret33.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret33.base, foo_#t~ret33.offset;havoc foo_#t~ret33.base, foo_#t~ret33.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret29, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 62#L655-3true 
[2021-10-28 08:40:15,333 INFO  L793   eck$LassoCheckResult]: Loop: 62#L655-3true assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 37#L656true assume !(ldv_is_in_set_#t~mem27.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem27.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset; 45#L655-2true call ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset;havoc ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 62#L655-3true 
[2021-10-28 08:40:15,341 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:15,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -1482586390, now seen corresponding path program 1 times
[2021-10-28 08:40:15,363 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:15,364 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824886309]
[2021-10-28 08:40:15,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:15,365 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:15,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:15,574 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 08:40:15,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:15,701 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 08:40:15,705 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:15,706 INFO  L85        PathProgramCache]: Analyzing trace with hash 59743, now seen corresponding path program 1 times
[2021-10-28 08:40:15,706 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:15,706 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563822123]
[2021-10-28 08:40:15,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:15,707 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:15,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:15,720 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 08:40:15,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:15,734 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 08:40:15,741 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:15,744 INFO  L85        PathProgramCache]: Analyzing trace with hash 1712557526, now seen corresponding path program 1 times
[2021-10-28 08:40:15,745 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:15,745 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737279185]
[2021-10-28 08:40:15,745 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:15,746 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:15,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 08:40:15,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 08:40:15,984 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 08:40:15,985 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737279185]
[2021-10-28 08:40:15,986 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737279185] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 08:40:15,987 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 08:40:15,988 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 08:40:15,988 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502862422]
[2021-10-28 08:40:16,308 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 08:40:16,327 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-28 08:40:16,328 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-28 08:40:16,331 INFO  L87              Difference]: Start difference. First operand  has 78 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 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-10-28 08:40:16,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 08:40:16,671 INFO  L93              Difference]: Finished difference Result 134 states and 154 transitions.
[2021-10-28 08:40:16,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-28 08:40:16,681 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 154 transitions.
[2021-10-28 08:40:16,691 INFO  L131   ngComponentsAnalysis]: Automaton has 10 accepting balls. 38
[2021-10-28 08:40:16,697 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 110 states and 130 transitions.
[2021-10-28 08:40:16,699 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 110
[2021-10-28 08:40:16,700 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 110
[2021-10-28 08:40:16,701 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 110 states and 130 transitions.
[2021-10-28 08:40:16,702 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 08:40:16,702 INFO  L681         BuchiCegarLoop]: Abstraction has 110 states and 130 transitions.
[2021-10-28 08:40:16,722 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 110 states and 130 transitions.
[2021-10-28 08:40:16,736 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87.
[2021-10-28 08:40:16,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 86 states have internal predecessors, (103), 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-10-28 08:40:16,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions.
[2021-10-28 08:40:16,740 INFO  L704         BuchiCegarLoop]: Abstraction has 87 states and 103 transitions.
[2021-10-28 08:40:16,740 INFO  L587         BuchiCegarLoop]: Abstraction has 87 states and 103 transitions.
[2021-10-28 08:40:16,741 INFO  L425         BuchiCegarLoop]: ======== Iteration 2============
[2021-10-28 08:40:16,741 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 103 transitions.
[2021-10-28 08:40:16,743 INFO  L131   ngComponentsAnalysis]: Automaton has 7 accepting balls. 25
[2021-10-28 08:40:16,744 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 08:40:16,744 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 08:40:16,745 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]
[2021-10-28 08:40:16,745 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2021-10-28 08:40:16,746 INFO  L791   eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY #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); 285#L-1 havoc main_#res;havoc foo_#t~ret32.base, foo_#t~ret32.offset, foo_#t~ret33.base, foo_#t~ret33.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 241#L666 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 242#L565 assume !(0 == assume_abort_if_not_~cond); 245#L564 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 246#L578 foo_#t~ret32.base, foo_#t~ret32.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret32.base, foo_#t~ret32.offset;havoc foo_#t~ret32.base, foo_#t~ret32.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 293#L565-2 assume !(0 == assume_abort_if_not_~cond); 226#L564-1 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 227#L578-1 foo_#t~ret33.base, foo_#t~ret33.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret33.base, foo_#t~ret33.offset;havoc foo_#t~ret33.base, foo_#t~ret33.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret29, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 294#L655-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 281#L655-4 ldv_is_in_set_#res := 0; 267#L660 mutex_lock_#t~ret29 := ldv_is_in_set_#res; 268#L669 assume !(0 != mutex_lock_#t~ret29);havoc mutex_lock_#t~ret29; 289#L669-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19, ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 277#L655-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 264#L655-9 ldv_is_in_set_#res := 0; 265#L660-1 ldv_set_add_#t~ret19 := ldv_is_in_set_#res; 269#L636 assume 0 == ldv_set_add_#t~ret19;havoc ldv_set_add_#t~ret19;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 266#L565-4 assume !(0 == assume_abort_if_not_~cond); 247#L564-2 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 248#L578-2 ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset;havoc ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 251#L592 havoc ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset; 252#L635 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret29, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 231#L655-13 
[2021-10-28 08:40:16,747 INFO  L793   eck$LassoCheckResult]: Loop: 231#L655-13 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 287#L656-2 assume !(ldv_is_in_set_#t~mem27.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem27.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset; 230#L655-12 call ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset;havoc ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 231#L655-13 
[2021-10-28 08:40:16,747 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:16,748 INFO  L85        PathProgramCache]: Analyzing trace with hash -1499045103, now seen corresponding path program 1 times
[2021-10-28 08:40:16,748 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:16,748 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368443578]
[2021-10-28 08:40:16,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:16,749 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:16,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:16,828 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 08:40:16,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:16,946 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 08:40:16,947 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:16,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 128260, now seen corresponding path program 1 times
[2021-10-28 08:40:16,948 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:16,948 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440467847]
[2021-10-28 08:40:16,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:16,949 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:16,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:16,958 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 08:40:16,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:16,966 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 08:40:16,967 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:16,967 INFO  L85        PathProgramCache]: Analyzing trace with hash 1017378804, now seen corresponding path program 1 times
[2021-10-28 08:40:16,967 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:16,968 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299275158]
[2021-10-28 08:40:16,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:16,968 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:17,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 08:40:17,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 08:40:17,603 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 08:40:17,604 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299275158]
[2021-10-28 08:40:17,605 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299275158] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 08:40:17,605 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 08:40:17,605 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 08:40:17,607 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112115574]
[2021-10-28 08:40:17,808 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 08:40:17,811 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-10-28 08:40:17,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2021-10-28 08:40:17,816 INFO  L87              Difference]: Start difference. First operand 87 states and 103 transitions. cyclomatic complexity: 23 Second operand  has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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-10-28 08:40:19,189 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 08:40:19,189 INFO  L93              Difference]: Finished difference Result 118 states and 140 transitions.
[2021-10-28 08:40:19,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-10-28 08:40:19,191 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 140 transitions.
[2021-10-28 08:40:19,194 INFO  L131   ngComponentsAnalysis]: Automaton has 10 accepting balls. 34
[2021-10-28 08:40:19,196 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 140 transitions.
[2021-10-28 08:40:19,196 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 118
[2021-10-28 08:40:19,197 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 118
[2021-10-28 08:40:19,197 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 118 states and 140 transitions.
[2021-10-28 08:40:19,198 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 08:40:19,198 INFO  L681         BuchiCegarLoop]: Abstraction has 118 states and 140 transitions.
[2021-10-28 08:40:19,199 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states and 140 transitions.
[2021-10-28 08:40:19,206 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104.
[2021-10-28 08:40:19,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 104 states have (on average 1.1923076923076923) internal successors, (124), 103 states have internal predecessors, (124), 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-10-28 08:40:19,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions.
[2021-10-28 08:40:19,208 INFO  L704         BuchiCegarLoop]: Abstraction has 104 states and 124 transitions.
[2021-10-28 08:40:19,209 INFO  L587         BuchiCegarLoop]: Abstraction has 104 states and 124 transitions.
[2021-10-28 08:40:19,209 INFO  L425         BuchiCegarLoop]: ======== Iteration 3============
[2021-10-28 08:40:19,209 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 124 transitions.
[2021-10-28 08:40:19,211 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 28
[2021-10-28 08:40:19,211 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 08:40:19,211 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 08:40:19,212 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]
[2021-10-28 08:40:19,213 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2021-10-28 08:40:19,213 INFO  L791   eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY #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); 514#L-1 havoc main_#res;havoc foo_#t~ret32.base, foo_#t~ret32.offset, foo_#t~ret33.base, foo_#t~ret33.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 470#L666 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 471#L565 assume !(0 == assume_abort_if_not_~cond); 474#L564 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 475#L578 foo_#t~ret32.base, foo_#t~ret32.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret32.base, foo_#t~ret32.offset;havoc foo_#t~ret32.base, foo_#t~ret32.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 522#L565-2 assume !(0 == assume_abort_if_not_~cond); 457#L564-1 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 458#L578-1 foo_#t~ret33.base, foo_#t~ret33.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret33.base, foo_#t~ret33.offset;havoc foo_#t~ret33.base, foo_#t~ret33.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret29, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 523#L655-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 511#L655-4 ldv_is_in_set_#res := 0; 496#L660 mutex_lock_#t~ret29 := ldv_is_in_set_#res; 497#L669 assume !(0 != mutex_lock_#t~ret29);havoc mutex_lock_#t~ret29; 520#L669-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19, ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 506#L655-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 493#L655-9 ldv_is_in_set_#res := 0; 494#L660-1 ldv_set_add_#t~ret19 := ldv_is_in_set_#res; 498#L636 assume 0 == ldv_set_add_#t~ret19;havoc ldv_set_add_#t~ret19;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 495#L565-4 assume !(0 == assume_abort_if_not_~cond); 476#L564-2 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 477#L578-2 ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset;havoc ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 480#L592 havoc ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset; 481#L635 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret29, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 540#L655-13 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 539#L655-14 ldv_is_in_set_#res := 0; 519#L660-2 mutex_lock_#t~ret29 := ldv_is_in_set_#res; 536#L669-3 assume !(0 != mutex_lock_#t~ret29);havoc mutex_lock_#t~ret29; 534#L669-5 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19, ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 466#L655-18 
[2021-10-28 08:40:19,214 INFO  L793   eck$LassoCheckResult]: Loop: 466#L655-18 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 527#L656-3 assume !(ldv_is_in_set_#t~mem27.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem27.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset; 465#L655-17 call ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset;havoc ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 466#L655-18 
[2021-10-28 08:40:19,214 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:19,214 INFO  L85        PathProgramCache]: Analyzing trace with hash -1553171628, now seen corresponding path program 1 times
[2021-10-28 08:40:19,215 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:19,215 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777398675]
[2021-10-28 08:40:19,215 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:19,216 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:19,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 08:40:19,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 08:40:19,404 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 08:40:19,404 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777398675]
[2021-10-28 08:40:19,405 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777398675] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 08:40:19,405 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 08:40:19,405 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-10-28 08:40:19,406 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244969092]
[2021-10-28 08:40:19,407 INFO  L796   eck$LassoCheckResult]: stem already infeasible
[2021-10-28 08:40:19,409 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:19,410 INFO  L85        PathProgramCache]: Analyzing trace with hash 156064, now seen corresponding path program 1 times
[2021-10-28 08:40:19,410 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:19,410 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480584130]
[2021-10-28 08:40:19,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:19,411 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:19,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:19,423 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 08:40:19,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:19,443 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 08:40:19,611 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 08:40:19,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-10-28 08:40:19,614 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2021-10-28 08:40:19,615 INFO  L87              Difference]: Start difference. First operand 104 states and 124 transitions. cyclomatic complexity: 28 Second operand  has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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-10-28 08:40:20,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 08:40:20,756 INFO  L93              Difference]: Finished difference Result 213 states and 257 transitions.
[2021-10-28 08:40:20,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-10-28 08:40:20,757 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 257 transitions.
[2021-10-28 08:40:20,760 INFO  L131   ngComponentsAnalysis]: Automaton has 22 accepting balls. 78
[2021-10-28 08:40:20,765 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 213 states and 257 transitions.
[2021-10-28 08:40:20,766 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 213
[2021-10-28 08:40:20,766 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 213
[2021-10-28 08:40:20,767 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 213 states and 257 transitions.
[2021-10-28 08:40:20,768 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 08:40:20,769 INFO  L681         BuchiCegarLoop]: Abstraction has 213 states and 257 transitions.
[2021-10-28 08:40:20,769 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 213 states and 257 transitions.
[2021-10-28 08:40:20,786 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 111.
[2021-10-28 08:40:20,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 111 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 110 states have internal predecessors, (131), 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-10-28 08:40:20,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions.
[2021-10-28 08:40:20,789 INFO  L704         BuchiCegarLoop]: Abstraction has 111 states and 131 transitions.
[2021-10-28 08:40:20,789 INFO  L587         BuchiCegarLoop]: Abstraction has 111 states and 131 transitions.
[2021-10-28 08:40:20,789 INFO  L425         BuchiCegarLoop]: ======== Iteration 4============
[2021-10-28 08:40:20,789 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 131 transitions.
[2021-10-28 08:40:20,791 INFO  L131   ngComponentsAnalysis]: Automaton has 9 accepting balls. 31
[2021-10-28 08:40:20,791 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 08:40:20,791 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 08:40:20,792 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]
[2021-10-28 08:40:20,793 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2021-10-28 08:40:20,793 INFO  L791   eck$LassoCheckResult]: Stem: 881#ULTIMATE.startENTRY #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); 867#L-1 havoc main_#res;havoc foo_#t~ret32.base, foo_#t~ret32.offset, foo_#t~ret33.base, foo_#t~ret33.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 819#L666 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 820#L565 assume !(0 == assume_abort_if_not_~cond); 823#L564 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 824#L578 foo_#t~ret32.base, foo_#t~ret32.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret32.base, foo_#t~ret32.offset;havoc foo_#t~ret32.base, foo_#t~ret32.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 877#L565-2 assume !(0 == assume_abort_if_not_~cond); 806#L564-1 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 807#L578-1 foo_#t~ret33.base, foo_#t~ret33.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret33.base, foo_#t~ret33.offset;havoc foo_#t~ret33.base, foo_#t~ret33.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret29, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 878#L655-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 863#L655-4 ldv_is_in_set_#res := 0; 845#L660 mutex_lock_#t~ret29 := ldv_is_in_set_#res; 846#L669 assume !(0 != mutex_lock_#t~ret29);havoc mutex_lock_#t~ret29; 873#L669-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19, ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 858#L655-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 842#L655-9 ldv_is_in_set_#res := 0; 843#L660-1 ldv_set_add_#t~ret19 := ldv_is_in_set_#res; 847#L636 assume 0 == ldv_set_add_#t~ret19;havoc ldv_set_add_#t~ret19;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 844#L565-4 assume !(0 == assume_abort_if_not_~cond); 825#L564-2 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 826#L578-2 ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset;havoc ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 829#L592 havoc ldv_list_add_#t~mem8.base, ldv_list_add_#t~mem8.offset; 830#L635 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret29, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 885#L655-13 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 871#L656-2 assume ldv_is_in_set_#t~mem27.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem27.offset == ldv_is_in_set_~e.offset;havoc ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset;ldv_is_in_set_#res := 1; 872#L660-2 mutex_lock_#t~ret29 := ldv_is_in_set_#res; 848#L669-3 assume !(0 != mutex_lock_#t~ret29);havoc mutex_lock_#t~ret29; 849#L669-5 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19, ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 864#L655-18 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 865#L656-3 
[2021-10-28 08:40:20,794 INFO  L793   eck$LassoCheckResult]: Loop: 865#L656-3 assume !(ldv_is_in_set_#t~mem27.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem27.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset; 814#L655-17 call ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset;havoc ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 815#L655-18 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 865#L656-3 
[2021-10-28 08:40:20,794 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:20,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -853809951, now seen corresponding path program 1 times
[2021-10-28 08:40:20,795 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:20,795 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86185801]
[2021-10-28 08:40:20,795 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:20,796 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:20,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 08:40:20,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 08:40:20,859 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 08:40:20,860 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86185801]
[2021-10-28 08:40:20,861 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86185801] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 08:40:20,864 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 08:40:20,864 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-28 08:40:20,865 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501914997]
[2021-10-28 08:40:20,865 INFO  L796   eck$LassoCheckResult]: stem already infeasible
[2021-10-28 08:40:20,866 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:20,868 INFO  L85        PathProgramCache]: Analyzing trace with hash 160924, now seen corresponding path program 2 times
[2021-10-28 08:40:20,868 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:20,869 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40810067]
[2021-10-28 08:40:20,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:20,875 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:20,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:20,887 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 08:40:20,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:20,901 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 08:40:21,085 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 08:40:21,086 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-28 08:40:21,086 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-28 08:40:21,086 INFO  L87              Difference]: Start difference. First operand 111 states and 131 transitions. cyclomatic complexity: 29 Second operand  has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-10-28 08:40:21,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 08:40:21,144 INFO  L93              Difference]: Finished difference Result 106 states and 123 transitions.
[2021-10-28 08:40:21,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-10-28 08:40:21,145 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 123 transitions.
[2021-10-28 08:40:21,147 INFO  L131   ngComponentsAnalysis]: Automaton has 9 accepting balls. 35
[2021-10-28 08:40:21,148 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 97 states and 114 transitions.
[2021-10-28 08:40:21,148 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 97
[2021-10-28 08:40:21,149 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 97
[2021-10-28 08:40:21,149 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 97 states and 114 transitions.
[2021-10-28 08:40:21,150 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 08:40:21,150 INFO  L681         BuchiCegarLoop]: Abstraction has 97 states and 114 transitions.
[2021-10-28 08:40:21,150 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states and 114 transitions.
[2021-10-28 08:40:21,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76.
[2021-10-28 08:40:21,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 75 states have internal predecessors, (88), 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-10-28 08:40:21,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions.
[2021-10-28 08:40:21,164 INFO  L704         BuchiCegarLoop]: Abstraction has 76 states and 88 transitions.
[2021-10-28 08:40:21,165 INFO  L587         BuchiCegarLoop]: Abstraction has 76 states and 88 transitions.
[2021-10-28 08:40:21,165 INFO  L425         BuchiCegarLoop]: ======== Iteration 5============
[2021-10-28 08:40:21,165 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 88 transitions.
[2021-10-28 08:40:21,166 INFO  L131   ngComponentsAnalysis]: Automaton has 6 accepting balls. 22
[2021-10-28 08:40:21,166 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 08:40:21,166 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 08:40:21,168 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]
[2021-10-28 08:40:21,169 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2021-10-28 08:40:21,170 INFO  L791   eck$LassoCheckResult]: Stem: 1091#ULTIMATE.startENTRY #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); 1082#L-1 havoc main_#res;havoc foo_#t~ret32.base, foo_#t~ret32.offset, foo_#t~ret33.base, foo_#t~ret33.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 1043#L666 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 1044#L565 assume !(0 == assume_abort_if_not_~cond); 1047#L564 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 1048#L578 foo_#t~ret32.base, foo_#t~ret32.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret32.base, foo_#t~ret32.offset;havoc foo_#t~ret32.base, foo_#t~ret32.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;havoc ldv_successful_malloc_#t~malloc7.base, ldv_successful_malloc_#t~malloc7.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 1089#L565-2 assume !(0 == assume_abort_if_not_~cond); 1032#L564-1 ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 1033#L578-1 foo_#t~ret33.base, foo_#t~ret33.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret33.base, foo_#t~ret33.offset;havoc foo_#t~ret33.base, foo_#t~ret33.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret29, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 1090#L655-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 1079#L655-4 ldv_is_in_set_#res := 0; 1064#L660 mutex_lock_#t~ret29 := ldv_is_in_set_#res; 1065#L669 assume !(0 != mutex_lock_#t~ret29);havoc mutex_lock_#t~ret29; 1086#L669-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19, ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 1074#L655-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 1062#L655-9 ldv_is_in_set_#res := 0; 1063#L660-1 ldv_set_add_#t~ret19 := ldv_is_in_set_#res; 1066#L636 assume !(0 == ldv_set_add_#t~ret19);havoc ldv_set_add_#t~ret19; 1061#L635 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret29, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 1036#L655-13 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 1037#L655-14 ldv_is_in_set_#res := 0; 1034#L660-2 mutex_lock_#t~ret29 := ldv_is_in_set_#res; 1035#L669-3 assume !(0 != mutex_lock_#t~ret29);havoc mutex_lock_#t~ret29; 1055#L669-5 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret19, ldv_set_add_#t~ret20.base, ldv_set_add_#t~ret20.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 1056#L655-18 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 1080#L655-19 ldv_is_in_set_#res := 0; 1045#L660-3 ldv_set_add_#t~ret19 := ldv_is_in_set_#res; 1046#L636-1 assume !(0 == ldv_set_add_#t~ret19);havoc ldv_set_add_#t~ret19; 1057#L635-1 mutex_unlock_#in~m.base, mutex_unlock_#in~m.offset := foo_~m2~0.base, foo_~m2~0.offset;havoc mutex_unlock_#t~ret30, mutex_unlock_~m.base, mutex_unlock_~m.offset;mutex_unlock_~m.base, mutex_unlock_~m.offset := mutex_unlock_#in~m.base, mutex_unlock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_unlock_~m.base, mutex_unlock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem27.base, ldv_is_in_set_#t~mem27.offset, ldv_is_in_set_#t~mem26.base, ldv_is_in_set_#t~mem26.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 1105#L655-23 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 1104#L655-24 ldv_is_in_set_#res := 0; 1103#L660-4 mutex_unlock_#t~ret30 := ldv_is_in_set_#res; 1102#L673 assume !(0 == mutex_unlock_#t~ret30);havoc mutex_unlock_#t~ret30; 1100#L673-2 ldv_set_del_#in~e.base, ldv_set_del_#in~e.offset, ldv_set_del_#in~s.base, ldv_set_del_#in~s.offset := mutex_unlock_~m.base, mutex_unlock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_del_#t~mem21.base, ldv_set_del_#t~mem21.offset, ldv_set_del_~__mptr~0.base, ldv_set_del_~__mptr~0.offset, ldv_set_del_#t~mem22.base, ldv_set_del_#t~mem22.offset, ldv_set_del_~__mptr~1.base, ldv_set_del_~__mptr~1.offset, ldv_set_del_#t~mem24.base, ldv_set_del_#t~mem24.offset, ldv_set_del_#t~mem23.base, ldv_set_del_#t~mem23.offset, ldv_set_del_~__mptr~2.base, ldv_set_del_~__mptr~2.offset, ldv_set_del_~e.base, ldv_set_del_~e.offset, ldv_set_del_~s.base, ldv_set_del_~s.offset, ldv_set_del_~m~0.base, ldv_set_del_~m~0.offset, ldv_set_del_~n~0.base, ldv_set_del_~n~0.offset;ldv_set_del_~e.base, ldv_set_del_~e.offset := ldv_set_del_#in~e.base, ldv_set_del_#in~e.offset;ldv_set_del_~s.base, ldv_set_del_~s.offset := ldv_set_del_#in~s.base, ldv_set_del_#in~s.offset;havoc ldv_set_del_~m~0.base, ldv_set_del_~m~0.offset;havoc ldv_set_del_~n~0.base, ldv_set_del_~n~0.offset;call ldv_set_del_#t~mem21.base, ldv_set_del_#t~mem21.offset := read~$Pointer$(ldv_set_del_~s.base, ldv_set_del_~s.offset, 4);ldv_set_del_~__mptr~0.base, ldv_set_del_~__mptr~0.offset := ldv_set_del_#t~mem21.base, ldv_set_del_#t~mem21.offset;havoc ldv_set_del_#t~mem21.base, ldv_set_del_#t~mem21.offset;ldv_set_del_~m~0.base, ldv_set_del_~m~0.offset := ldv_set_del_~__mptr~0.base, ldv_set_del_~__mptr~0.offset - 4;call ldv_set_del_#t~mem22.base, ldv_set_del_#t~mem22.offset := read~$Pointer$(ldv_set_del_~m~0.base, 4 + ldv_set_del_~m~0.offset, 4);ldv_set_del_~__mptr~1.base, ldv_set_del_~__mptr~1.offset := ldv_set_del_#t~mem22.base, ldv_set_del_#t~mem22.offset;havoc ldv_set_del_#t~mem22.base, ldv_set_del_#t~mem22.offset;ldv_set_del_~n~0.base, ldv_set_del_~n~0.offset := ldv_set_del_~__mptr~1.base, ldv_set_del_~__mptr~1.offset - 4; 1098#L646-3 
[2021-10-28 08:40:21,180 INFO  L793   eck$LassoCheckResult]: Loop: 1098#L646-3 assume !!(ldv_set_del_~m~0.base != ldv_set_del_~s.base || 4 + ldv_set_del_~m~0.offset != ldv_set_del_~s.offset);call ldv_set_del_#t~mem24.base, ldv_set_del_#t~mem24.offset := read~$Pointer$(ldv_set_del_~m~0.base, ldv_set_del_~m~0.offset, 4); 1099#L647 assume !(ldv_set_del_#t~mem24.base == ldv_set_del_~e.base && ldv_set_del_#t~mem24.offset == ldv_set_del_~e.offset);havoc ldv_set_del_#t~mem24.base, ldv_set_del_#t~mem24.offset; 1101#L646-2 ldv_set_del_~m~0.base, ldv_set_del_~m~0.offset := ldv_set_del_~n~0.base, ldv_set_del_~n~0.offset;call ldv_set_del_#t~mem23.base, ldv_set_del_#t~mem23.offset := read~$Pointer$(ldv_set_del_~n~0.base, 4 + ldv_set_del_~n~0.offset, 4);ldv_set_del_~__mptr~2.base, ldv_set_del_~__mptr~2.offset := ldv_set_del_#t~mem23.base, ldv_set_del_#t~mem23.offset;havoc ldv_set_del_#t~mem23.base, ldv_set_del_#t~mem23.offset;ldv_set_del_~n~0.base, ldv_set_del_~n~0.offset := ldv_set_del_~__mptr~2.base, ldv_set_del_~__mptr~2.offset - 4; 1098#L646-3 
[2021-10-28 08:40:21,181 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:21,181 INFO  L85        PathProgramCache]: Analyzing trace with hash 760639302, now seen corresponding path program 1 times
[2021-10-28 08:40:21,181 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:21,182 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896201415]
[2021-10-28 08:40:21,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:21,182 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:21,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 08:40:21,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 08:40:21,259 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 08:40:21,264 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896201415]
[2021-10-28 08:40:21,264 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896201415] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 08:40:21,264 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 08:40:21,265 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-28 08:40:21,265 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053420612]
[2021-10-28 08:40:21,266 INFO  L796   eck$LassoCheckResult]: stem already infeasible
[2021-10-28 08:40:21,267 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 08:40:21,267 INFO  L85        PathProgramCache]: Analyzing trace with hash 224709, now seen corresponding path program 1 times
[2021-10-28 08:40:21,267 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 08:40:21,267 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746646830]
[2021-10-28 08:40:21,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 08:40:21,268 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 08:40:21,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:21,276 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 08:40:21,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 08:40:21,285 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 08:40:21,472 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 08:40:21,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-28 08:40:21,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-28 08:40:21,474 INFO  L87              Difference]: Start difference. First operand 76 states and 88 transitions. cyclomatic complexity: 18 Second operand  has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-10-28 08:40:21,489 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 08:40:21,489 INFO  L93              Difference]: Finished difference Result 18 states and 17 transitions.
[2021-10-28 08:40:21,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-10-28 08:40:21,489 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 17 transitions.
[2021-10-28 08:40:21,490 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2021-10-28 08:40:21,490 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions.
[2021-10-28 08:40:21,490 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2021-10-28 08:40:21,490 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2021-10-28 08:40:21,490 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2021-10-28 08:40:21,490 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 08:40:21,491 INFO  L681         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-10-28 08:40:21,491 INFO  L704         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-10-28 08:40:21,491 INFO  L587         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-10-28 08:40:21,491 INFO  L425         BuchiCegarLoop]: ======== Iteration 6============
[2021-10-28 08:40:21,491 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2021-10-28 08:40:21,491 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2021-10-28 08:40:21,491 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2021-10-28 08:40:21,498 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.10 08:40:21 BoogieIcfgContainer
[2021-10-28 08:40:21,498 INFO  L132        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2021-10-28 08:40:21,498 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-28 08:40:21,499 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-10-28 08:40:21,499 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-10-28 08:40:21,499 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:40:15" (3/4) ...
[2021-10-28 08:40:21,503 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2021-10-28 08:40:21,503 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-28 08:40:21,505 INFO  L168              Benchmark]: Toolchain (without parser) took 8365.13 ms. Allocated memory was 90.2 MB in the beginning and 144.7 MB in the end (delta: 54.5 MB). Free memory was 53.5 MB in the beginning and 57.3 MB in the end (delta: -3.8 MB). Peak memory consumption was 49.3 MB. Max. memory is 16.1 GB.
[2021-10-28 08:40:21,506 INFO  L168              Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 90.2 MB. Free memory was 59.4 MB in the beginning and 59.4 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-28 08:40:21,507 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 700.23 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 53.3 MB in the beginning and 83.1 MB in the end (delta: -29.8 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB.
[2021-10-28 08:40:21,507 INFO  L168              Benchmark]: Boogie Procedure Inliner took 91.29 ms. Allocated memory is still 117.4 MB. Free memory was 83.1 MB in the beginning and 79.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-28 08:40:21,508 INFO  L168              Benchmark]: Boogie Preprocessor took 98.65 ms. Allocated memory is still 117.4 MB. Free memory was 79.8 MB in the beginning and 76.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
[2021-10-28 08:40:21,509 INFO  L168              Benchmark]: RCFGBuilder took 1147.76 ms. Allocated memory is still 117.4 MB. Free memory was 76.4 MB in the beginning and 72.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB.
[2021-10-28 08:40:21,509 INFO  L168              Benchmark]: BuchiAutomizer took 6314.86 ms. Allocated memory was 117.4 MB in the beginning and 144.7 MB in the end (delta: 27.3 MB). Free memory was 72.2 MB in the beginning and 57.3 MB in the end (delta: 14.9 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.1 GB.
[2021-10-28 08:40:21,510 INFO  L168              Benchmark]: Witness Printer took 5.00 ms. Allocated memory is still 144.7 MB. Free memory is still 57.3 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-28 08:40:21,514 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.31 ms. Allocated memory is still 90.2 MB. Free memory was 59.4 MB in the beginning and 59.4 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB.
 * CACSL2BoogieTranslator took 700.23 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 53.3 MB in the beginning and 83.1 MB in the end (delta: -29.8 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB.
 * Boogie Procedure Inliner took 91.29 ms. Allocated memory is still 117.4 MB. Free memory was 83.1 MB in the beginning and 79.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * Boogie Preprocessor took 98.65 ms. Allocated memory is still 117.4 MB. Free memory was 79.8 MB in the beginning and 76.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
 * RCFGBuilder took 1147.76 ms. Allocated memory is still 117.4 MB. Free memory was 76.4 MB in the beginning and 72.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB.
 * BuchiAutomizer took 6314.86 ms. Allocated memory was 117.4 MB in the beginning and 144.7 MB in the end (delta: 27.3 MB). Free memory was 72.2 MB in the beginning and 57.3 MB in the end (delta: 14.9 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.1 GB.
 * Witness Printer took 5.00 ms. Allocated memory is still 144.7 MB. Free memory is still 57.3 MB. There was no memory consumed. Max. memory is 16.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 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 6.2s and 6 iterations.  TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 1.9s. 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, 160 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 111 states and ocurred in iteration 3.	Nontrivial modules had stage [0, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 293 SDtfs, 830 SDslu, 778 SDs, 0 SdLazy, 737 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time	LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	
  - TerminationAnalysisResult: Termination proven
    Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
[2021-10-28 08:40:21,588 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88cd2cff-2fe6-4e91-b718-921b4f0064dd/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...