./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:39:05,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:39:06,050 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:39:06,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:39:06,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:39:06,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:39:06,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:39:06,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:39:06,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:39:06,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:39:06,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:39:06,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:39:06,115 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:39:06,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:39:06,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:39:06,117 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:39:06,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:39:06,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:39:06,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:39:06,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:39:06,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:39:06,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:39:06,122 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:39:06,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:39:06,123 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:39:06,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:39:06,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:39:06,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:39:06,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:06,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:39:06,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:39:06,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:39:06,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:39:06,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:39:06,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:39:06,128 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:39:06,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:39:06,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:39:06,129 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:39:06,129 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP 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(G ! call(reach_error())) ) 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 -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2023-11-06 22:39:06,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:06,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:06,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:06,533 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:06,533 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:06,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-11-06 22:39:09,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:39:09,925 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:39:09,926 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-11-06 22:39:09,945 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/data/e4d42946d/63369bf628844f99a21813ce3818116c/FLAGaeef9642c [2023-11-06 22:39:10,007 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/data/e4d42946d/63369bf628844f99a21813ce3818116c [2023-11-06 22:39:10,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:39:10,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:39:10,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:10,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:39:10,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:39:10,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ab593c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10, skipping insertion in model container [2023-11-06 22:39:10,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,083 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:10,461 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-11-06 22:39:10,471 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-11-06 22:39:10,473 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-11-06 22:39:10,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:10,498 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:39:10,560 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-11-06 22:39:10,561 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-11-06 22:39:10,562 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-11-06 22:39:10,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:10,597 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:39:10,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10 WrapperNode [2023-11-06 22:39:10,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:10,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:10,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:39:10,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:39:10,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,655 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 138 [2023-11-06 22:39:10,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:10,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:39:10,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:39:10,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:39:10,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:39:10,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:39:10,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:39:10,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:39:10,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (1/1) ... [2023-11-06 22:39:10,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:10,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:39:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-11-06 22:39:10,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-11-06 22:39:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-11-06 22:39:10,783 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-11-06 22:39:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:39:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-11-06 22:39:10,783 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-11-06 22:39:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:39:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-11-06 22:39:10,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-11-06 22:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:39:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:39:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-11-06 22:39:10,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-11-06 22:39:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:39:10,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:39:10,931 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:39:10,933 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:39:11,229 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:39:11,237 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:39:11,237 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:39:11,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:11 BoogieIcfgContainer [2023-11-06 22:39:11,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:39:11,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:39:11,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:39:11,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:39:11,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:39:10" (1/3) ... [2023-11-06 22:39:11,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33deee72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:11, skipping insertion in model container [2023-11-06 22:39:11,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:10" (2/3) ... [2023-11-06 22:39:11,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33deee72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:11, skipping insertion in model container [2023-11-06 22:39:11,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:11" (3/3) ... [2023-11-06 22:39:11,249 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2023-11-06 22:39:11,269 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:39:11,269 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-06 22:39:11,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:39:11,342 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48d2c0b2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:39:11,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-06 22:39:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:39:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:39:11,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:11,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:11,374 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:11,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2023-11-06 22:39:11,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:11,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271793603] [2023-11-06 22:39:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:11,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:39:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:11,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:11,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:39:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:39:11,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271793603] [2023-11-06 22:39:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271793603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:39:11,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686295463] [2023-11-06 22:39:11,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:11,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:11,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:11,840 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:39:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:12,077 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2023-11-06 22:39:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:39:12,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-11-06 22:39:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:12,092 INFO L225 Difference]: With dead ends: 147 [2023-11-06 22:39:12,092 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:39:12,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:12,102 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:12,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:39:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:39:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2023-11-06 22:39:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:39:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-11-06 22:39:12,153 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2023-11-06 22:39:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:12,154 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-11-06 22:39:12,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:39:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-11-06 22:39:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:39:12,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:12,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:12,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:39:12,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:12,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2023-11-06 22:39:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:12,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073464289] [2023-11-06 22:39:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:39:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:12,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:12,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:39:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:39:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:12,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073464289] [2023-11-06 22:39:12,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073464289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:12,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:39:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137773595] [2023-11-06 22:39:12,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:12,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:39:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:12,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:39:12,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:39:12,406 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:39:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:12,653 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-11-06 22:39:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:39:12,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-11-06 22:39:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:12,659 INFO L225 Difference]: With dead ends: 82 [2023-11-06 22:39:12,659 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:39:12,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:39:12,662 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:12,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 141 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:39:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:39:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2023-11-06 22:39:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2023-11-06 22:39:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-11-06 22:39:12,693 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2023-11-06 22:39:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:12,694 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-11-06 22:39:12,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:39:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-11-06 22:39:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:39:12,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:12,696 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:12,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:39:12,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:12,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2023-11-06 22:39:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823569481] [2023-11-06 22:39:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:39:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:39:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:39:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:13,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823569481] [2023-11-06 22:39:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823569481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:13,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:13,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:39:13,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565181227] [2023-11-06 22:39:13,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:13,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:39:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:39:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:13,205 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:39:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:13,948 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2023-11-06 22:39:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:39:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-11-06 22:39:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:13,952 INFO L225 Difference]: With dead ends: 206 [2023-11-06 22:39:13,953 INFO L226 Difference]: Without dead ends: 145 [2023-11-06 22:39:13,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:39:13,956 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 142 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:13,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 164 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:39:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-06 22:39:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2023-11-06 22:39:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) [2023-11-06 22:39:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-11-06 22:39:13,981 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2023-11-06 22:39:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:13,986 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-11-06 22:39:13,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:39:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-11-06 22:39:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:39:13,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:13,990 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:13,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:39:13,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:13,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2023-11-06 22:39:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982869243] [2023-11-06 22:39:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:13,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:39:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:39:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:39:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:39:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:39:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-06 22:39:14,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982869243] [2023-11-06 22:39:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982869243] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:39:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190383916] [2023-11-06 22:39:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:14,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:14,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:14,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:14,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:39:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:39:14,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:39:14,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:14,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190383916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:14,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:39:14,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-06 22:39:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688129768] [2023-11-06 22:39:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:14,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:39:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:14,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:39:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:14,449 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:39:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:14,473 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2023-11-06 22:39:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:39:14,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2023-11-06 22:39:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:14,476 INFO L225 Difference]: With dead ends: 219 [2023-11-06 22:39:14,476 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:39:14,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:14,479 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:14,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:39:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-06 22:39:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 96 states have internal predecessors, (107), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (30), 20 states have call predecessors, (30), 18 states have call successors, (30) [2023-11-06 22:39:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2023-11-06 22:39:14,498 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2023-11-06 22:39:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:14,498 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2023-11-06 22:39:14,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:39:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2023-11-06 22:39:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:39:14,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:14,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:39:14,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:14,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:14,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:14,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2023-11-06 22:39:14,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:14,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416393326] [2023-11-06 22:39:14,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:17,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:39:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:17,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:19,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:39:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:19,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:39:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:39:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:19,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:39:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:39:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416393326] [2023-11-06 22:39:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416393326] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:39:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428809805] [2023-11-06 22:39:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:20,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:20,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:20,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:20,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:39:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:20,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 150 conjunts are in the unsatisfiable core [2023-11-06 22:39:20,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:20,594 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:39:20,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 22:39:20,990 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-06 22:39:20,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 22:39:22,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:39:22,486 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2023-11-06 22:39:22,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:39:22,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:22,573 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 22:39:22,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-06 22:39:22,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2023-11-06 22:39:22,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:22,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2023-11-06 22:39:22,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-06 22:39:22,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-06 22:39:22,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2023-11-06 22:39:22,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:39:22,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2023-11-06 22:39:22,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:39:22,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-06 22:39:22,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:39:22,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-06 22:39:22,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-06 22:39:41,185 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:39:41,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:41,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:41,391 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Unexpected substitution problem. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 22:39:41,395 INFO L158 Benchmark]: Toolchain (without parser) took 31382.93ms. Allocated memory was 142.6MB in the beginning and 304.1MB in the end (delta: 161.5MB). Free memory was 114.9MB in the beginning and 148.7MB in the end (delta: -33.8MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. [2023-11-06 22:39:41,395 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 117.2MB in the end (delta: 83.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:39:41,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.38ms. Allocated memory is still 142.6MB. Free memory was 114.6MB in the beginning and 95.1MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:39:41,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.98ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:39:41,396 INFO L158 Benchmark]: Boogie Preprocessor took 40.44ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:39:41,396 INFO L158 Benchmark]: RCFGBuilder took 542.78ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 69.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 22:39:41,397 INFO L158 Benchmark]: TraceAbstraction took 30151.87ms. Allocated memory was 142.6MB in the beginning and 304.1MB in the end (delta: 161.5MB). Free memory was 68.4MB in the beginning and 148.7MB in the end (delta: -80.3MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2023-11-06 22:39:41,399 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 117.2MB in the end (delta: 83.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.38ms. Allocated memory is still 142.6MB. Free memory was 114.6MB in the beginning and 95.1MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.98ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.44ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.78ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 69.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 30151.87ms. Allocated memory was 142.6MB in the beginning and 304.1MB in the end (delta: 161.5MB). Free memory was 68.4MB in the beginning and 148.7MB in the end (delta: -80.3MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Unexpected substitution problem. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Unexpected substitution problem.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:305) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:39:41,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:39:44,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:39:44,279 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:39:44,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:39:44,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:39:44,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:39:44,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:39:44,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:39:44,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:39:44,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:39:44,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:39:44,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:39:44,334 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:39:44,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:39:44,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:39:44,336 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:39:44,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:39:44,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:39:44,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:39:44,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:39:44,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:39:44,346 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:39:44,346 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:39:44,346 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:39:44,347 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:39:44,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:39:44,348 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:39:44,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:39:44,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:39:44,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:39:44,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:44,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:39:44,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:39:44,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:39:44,352 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:39:44,352 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:39:44,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:39:44,353 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:39:44,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:39:44,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:39:44,354 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:39:44,355 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:39:44,355 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP 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(G ! call(reach_error())) ) 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 -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2023-11-06 22:39:44,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:44,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:44,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:44,810 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:44,810 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:44,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-11-06 22:39:48,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:39:48,437 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:39:48,438 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-11-06 22:39:48,459 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/data/5728c61ce/9a6796c9e2d641f68881f9a3587b964d/FLAGa77942aed [2023-11-06 22:39:48,474 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/data/5728c61ce/9a6796c9e2d641f68881f9a3587b964d [2023-11-06 22:39:48,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:39:48,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:39:48,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:48,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:39:48,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:39:48,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:48" (1/1) ... [2023-11-06 22:39:48,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6651ee29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:48, skipping insertion in model container [2023-11-06 22:39:48,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:48" (1/1) ... [2023-11-06 22:39:48,536 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:48,971 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-11-06 22:39:48,977 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-11-06 22:39:48,979 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-11-06 22:39:48,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:48,996 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-06 22:39:49,009 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:49,053 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-11-06 22:39:49,054 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-11-06 22:39:49,055 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-11-06 22:39:49,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:49,060 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:39:49,158 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-11-06 22:39:49,179 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-11-06 22:39:49,180 WARN L240 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_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-11-06 22:39:49,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:49,242 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:39:49,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49 WrapperNode [2023-11-06 22:39:49,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:49,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:49,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:39:49,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:39:49,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,310 INFO L138 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 134 [2023-11-06 22:39:49,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:49,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:39:49,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:39:49,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:39:49,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:39:49,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:39:49,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:39:49,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:39:49,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (1/1) ... [2023-11-06 22:39:49,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:49,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:49,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:49,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:39:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-11-06 22:39:49,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-11-06 22:39:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-11-06 22:39:49,474 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-11-06 22:39:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:39:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-11-06 22:39:49,475 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-11-06 22:39:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:39:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:39:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-11-06 22:39:49,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-11-06 22:39:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:39:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:39:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:39:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:39:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-11-06 22:39:49,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-11-06 22:39:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:39:49,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:39:49,643 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:39:49,644 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:39:50,164 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:39:50,172 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:39:50,172 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:39:50,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:50 BoogieIcfgContainer [2023-11-06 22:39:50,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:39:50,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:39:50,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:39:50,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:39:50,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:39:48" (1/3) ... [2023-11-06 22:39:50,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5ddce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:50, skipping insertion in model container [2023-11-06 22:39:50,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:49" (2/3) ... [2023-11-06 22:39:50,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5ddce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:50, skipping insertion in model container [2023-11-06 22:39:50,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:50" (3/3) ... [2023-11-06 22:39:50,185 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2023-11-06 22:39:50,206 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:39:50,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-06 22:39:50,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:39:50,271 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c16a4d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:39:50,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-06 22:39:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:39:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:39:50,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:50,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:50,288 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:50,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:50,294 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2023-11-06 22:39:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:50,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233510625] [2023-11-06 22:39:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:50,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:50,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:50,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:50,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:39:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:39:50,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:39:50,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:50,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:50,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233510625] [2023-11-06 22:39:50,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233510625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:50,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:50,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:39:50,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925814901] [2023-11-06 22:39:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:50,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:39:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:50,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:39:50,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:39:50,638 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:39:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:50,699 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2023-11-06 22:39:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:39:50,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-06 22:39:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:50,712 INFO L225 Difference]: With dead ends: 130 [2023-11-06 22:39:50,713 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 22:39:50,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:39:50,725 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:50,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 22:39:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-06 22:39:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:39:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-11-06 22:39:50,800 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2023-11-06 22:39:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:50,800 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-11-06 22:39:50,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:39:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-11-06 22:39:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:39:50,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:50,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:50,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:51,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:51,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:51,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:51,033 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2023-11-06 22:39:51,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926169182] [2023-11-06 22:39:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:51,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:51,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:51,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:51,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:39:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:51,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:39:51,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:39:51,817 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:51,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:51,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926169182] [2023-11-06 22:39:51,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926169182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:51,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:51,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798836711] [2023-11-06 22:39:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:51,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:39:51,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:39:51,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:39:51,828 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:39:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:52,462 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2023-11-06 22:39:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:39:52,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-11-06 22:39:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:52,467 INFO L225 Difference]: With dead ends: 170 [2023-11-06 22:39:52,467 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:39:52,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:52,470 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 59 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:52,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 175 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:39:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:39:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2023-11-06 22:39:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (23), 17 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-06 22:39:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2023-11-06 22:39:52,494 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2023-11-06 22:39:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:52,495 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2023-11-06 22:39:52,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:39:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2023-11-06 22:39:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:39:52,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:52,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:52,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:52,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:52,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:52,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2023-11-06 22:39:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:52,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034056574] [2023-11-06 22:39:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:52,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:52,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:52,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:52,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:39:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:39:52,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:39:52,851 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:52,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:52,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034056574] [2023-11-06 22:39:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034056574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:52,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:52,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769512109] [2023-11-06 22:39:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:52,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:39:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:39:52,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:52,858 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:39:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:52,893 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2023-11-06 22:39:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:39:52,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-11-06 22:39:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:52,902 INFO L225 Difference]: With dead ends: 108 [2023-11-06 22:39:52,902 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:39:52,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:52,906 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:52,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:39:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2023-11-06 22:39:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2023-11-06 22:39:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2023-11-06 22:39:52,950 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2023-11-06 22:39:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:52,951 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2023-11-06 22:39:52,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:39:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2023-11-06 22:39:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:39:52,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:52,958 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:52,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:53,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:53,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:53,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:53,170 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2023-11-06 22:39:53,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:53,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337836897] [2023-11-06 22:39:53,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:53,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:53,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:53,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:53,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:39:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:53,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:39:53,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:53,586 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:39:53,598 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:39:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:39:53,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:53,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337836897] [2023-11-06 22:39:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337836897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:53,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:53,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:39:53,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960148804] [2023-11-06 22:39:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:53,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:39:53,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:53,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:39:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:39:53,948 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-06 22:39:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:56,456 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2023-11-06 22:39:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:39:56,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 67 [2023-11-06 22:39:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:56,459 INFO L225 Difference]: With dead ends: 268 [2023-11-06 22:39:56,459 INFO L226 Difference]: Without dead ends: 162 [2023-11-06 22:39:56,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:39:56,461 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 165 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:56,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 309 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-06 22:39:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-06 22:39:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2023-11-06 22:39:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 19 states have call successors, (19), 10 states have call predecessors, (19), 14 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2023-11-06 22:39:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2023-11-06 22:39:56,504 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2023-11-06 22:39:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:56,505 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2023-11-06 22:39:56,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-06 22:39:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2023-11-06 22:39:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:39:56,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:56,514 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:56,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-06 22:39:56,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:56,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:56,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2023-11-06 22:39:56,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:56,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77234262] [2023-11-06 22:39:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:56,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:56,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:56,732 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:56,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:39:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:56,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:39:56,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:39:57,014 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:57,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:57,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77234262] [2023-11-06 22:39:57,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77234262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:57,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:57,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:57,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366843400] [2023-11-06 22:39:57,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:57,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:39:57,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:39:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:57,017 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:39:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:57,048 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2023-11-06 22:39:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:39:57,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2023-11-06 22:39:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:57,052 INFO L225 Difference]: With dead ends: 196 [2023-11-06 22:39:57,052 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 22:39:57,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:57,054 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:57,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 22:39:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-11-06 22:39:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2023-11-06 22:39:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2023-11-06 22:39:57,084 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2023-11-06 22:39:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:57,085 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2023-11-06 22:39:57,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:39:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2023-11-06 22:39:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:39:57,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:57,088 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2023-11-06 22:39:57,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:57,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:57,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:57,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2023-11-06 22:39:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802294198] [2023-11-06 22:39:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:57,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:57,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:57,305 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:57,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:39:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-06 22:39:57,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:57,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-06 22:39:58,133 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:39:58,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:40:06,114 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 57 DAG size of output: 30 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:40:06,115 INFO L322 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-11-06 22:40:06,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2023-11-06 22:40:06,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-06 22:40:06,523 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-06 22:40:07,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-06 22:40:08,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-06 22:40:13,548 INFO L322 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2023-11-06 22:40:13,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 148 [2023-11-06 22:40:13,772 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-06 22:40:13,772 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 47 [2023-11-06 22:40:13,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:40:13,946 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:40:53,584 WARN L293 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 294 DAG size of output: 287 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:40:59,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:59,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-06 22:40:59,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:59,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-06 22:41:03,109 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse30 (select |c_#memory_$Pointer$.base| (_ bv3 32)))) (let ((.cse8 (select .cse30 (_ bv0 32)))) (let ((.cse61 (store (select |c_old(#memory_$Pointer$.base)| .cse8) (_ bv0 32) |c_mutex_lock_#in~m#1.base|))) (let ((.cse38 (store |c_old(#memory_$Pointer$.base)| .cse8 .cse61))) (let ((.cse36 (select (select .cse38 (_ bv3 32)) (_ bv0 32)))) (let ((.cse33 (select |c_#memory_$Pointer$.offset| (_ bv3 32))) (.cse7 (select |c_#memory_$Pointer$.offset| .cse8)) (.cse6 (= (_ bv3 32) .cse36))) (let ((.cse10 (= .cse36 .cse8)) (.cse3 (not .cse6)) (.cse43 (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store (store (store |c_#memory_$Pointer$.offset| .cse36 v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) (_ bv3 32) v_DerPreprocessor_3))) (and (= (_ bv4 32) (select v_DerPreprocessor_3 (_ bv0 32))) (= v_DerPreprocessor_1 (select .cse62 .cse36)) (= (select .cse62 .cse8) .cse7))))) (.cse0 (= (_ bv4 32) (select .cse33 (_ bv0 32)))) (.cse40 (select .cse38 .cse36)) (.cse42 (select |c_#memory_$Pointer$.base| .cse36)) (.cse39 (select (select |c_#memory_$Pointer$.base| .cse8) (_ bv4 32)))) (let ((.cse9 (= (let ((.cse60 (store |c_old(#memory_$Pointer$.base)| .cse8 (store (store .cse61 (_ bv4 32) .cse39) (_ bv8 32) (_ bv3 32))))) (store .cse60 (_ bv3 32) (store (select .cse60 (_ bv3 32)) (_ bv0 32) .cse8))) |c_#memory_$Pointer$.base|)) (.cse4 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse57 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse57 (_ bv0 32))) (= |c_#memory_$Pointer$.base| (let ((.cse58 (let ((.cse59 (store .cse40 .cse57 (select .cse42 .cse57)))) (store (store |c_old(#memory_$Pointer$.base)| .cse36 .cse59) .cse8 (store (store (select (store .cse38 .cse36 .cse59) .cse8) (_ bv4 32) .cse39) (_ bv8 32) (_ bv3 32)))))) (store .cse58 (_ bv3 32) (store (select .cse58 (_ bv3 32)) (_ bv0 32) .cse8)))))))) (.cse5 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse54 (let ((.cse55 (let ((.cse56 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse40 .cse56 (select .cse42 .cse56))))) (store (store |c_old(#memory_$Pointer$.base)| .cse36 .cse55) .cse8 (store (store (select (store .cse38 .cse36 .cse55) .cse8) (_ bv4 32) .cse39) (_ bv8 32) (_ bv3 32)))))) (store .cse54 (_ bv3 32) (store (select .cse54 (_ bv3 32)) (_ bv0 32) .cse8)))))) (.cse44 (or (and .cse0 .cse3) (and .cse43 .cse0))) (.cse1 (not .cse10)) (.cse2 (not (= (_ bv3 32) .cse8)))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3))) (and .cse6 (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (_ bv4 32) (select v_DerPreprocessor_1 (_ bv0 32))) (= .cse7 (select (store (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_2) (_ bv3 32) v_DerPreprocessor_1) .cse8)))) .cse0 .cse2 .cse9) (and .cse10 .cse0 .cse2 .cse9) (let ((.cse18 (= (_ bv3 32) |c_mutex_lock_#in~m#1.base|))) (and (let ((.cse19 (select |c_old(#memory_$Pointer$.base)| (_ bv3 32)))) (let ((.cse12 (store |c_old(#memory_$Pointer$.base)| (_ bv3 32) (store .cse19 (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse13 (select .cse30 (_ bv4 32))) (.cse14 (select .cse12 |c_mutex_lock_#in~m#1.base|)) (.cse16 (select |c_#memory_$Pointer$.base| |c_mutex_lock_#in~m#1.base|)) (.cse17 (not .cse18))) (or (and (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (not (= __ldv_list_add_~next.offset (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse11 (let ((.cse15 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse14 .cse15 (select .cse16 .cse15))))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse11) (_ bv3 32) (store (store (store (select (store .cse12 |c_mutex_lock_#in~m#1.base| .cse11) (_ bv3 32)) (_ bv4 32) .cse13) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32))))))) .cse17) (and .cse18 (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| (_ bv3 32) (store (store (store .cse19 (_ bv4 32) .cse13) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32))))) (and .cse17 (or (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse20 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse20 (_ bv0 32))) (= |c_#memory_$Pointer$.base| (let ((.cse21 (store .cse14 .cse20 (select .cse16 .cse20)))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse21) (_ bv3 32) (store (store (store (select (store .cse12 |c_mutex_lock_#in~m#1.base| .cse21) (_ bv3 32)) (_ bv4 32) .cse13) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32)))))))) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse22 (let ((.cse23 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse14 .cse23 (select .cse16 .cse23))))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse22) (_ bv3 32) (store (store (store (select (store .cse12 |c_mutex_lock_#in~m#1.base| .cse22) (_ bv3 32)) (_ bv4 32) .cse13) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32)))))))) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse24 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse24 (_ bv0 32))) (not (= __ldv_list_add_~next.offset (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse25 (store .cse14 .cse24 (select .cse16 .cse24)))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse25) (_ bv3 32) (store (store (store (select (store .cse12 |c_mutex_lock_#in~m#1.base| .cse25) (_ bv3 32)) (_ bv4 32) .cse13) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32)))))))) (and (or (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse26 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse26 (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse27 (store .cse14 .cse26 (select .cse16 .cse26)))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse27) (_ bv3 32) (store (store (store (select (store .cse12 |c_mutex_lock_#in~m#1.base| .cse27) (_ bv3 32)) (_ bv4 32) .cse13) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32)))))))) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse28 (let ((.cse29 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse14 .cse29 (select .cse16 .cse29))))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse28) (_ bv3 32) (store (store (store (select (store .cse12 |c_mutex_lock_#in~m#1.base| .cse28) (_ bv3 32)) (_ bv4 32) .cse13) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32)))))))) .cse17))))) (let ((.cse32 (select |c_#memory_$Pointer$.offset| |c_mutex_lock_#in~m#1.base|))) (let ((.cse31 (store .cse32 (_ bv0 32) (_ bv4 32)))) (let ((.cse34 (exists ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse32 (select (store (store |c_#memory_$Pointer$.offset| |c_mutex_lock_#in~m#1.base| v_DerPreprocessor_7) (_ bv3 32) .cse31) |c_mutex_lock_#in~m#1.base|))))) (or (and (exists ((v_prenex_87 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (store |c_#memory_$Pointer$.offset| |c_mutex_lock_#in~m#1.base| v_prenex_87) (_ bv3 32) .cse31) |c_mutex_lock_#in~m#1.base|) .cse32)) (= .cse33 .cse31) .cse34) (and (exists ((v_prenex_75 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_76 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse32 (select (store (store |c_#memory_$Pointer$.offset| |c_mutex_lock_#in~m#1.base| v_prenex_75) (_ bv3 32) v_prenex_76) |c_mutex_lock_#in~m#1.base|)) (= (_ bv4 32) (select v_prenex_76 (_ bv0 32))))) .cse0 .cse34) (and .cse18 .cse0))))))) (and (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse35 (let ((.cse37 (let ((.cse41 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse40 .cse41 (select .cse42 .cse41))))) (store (store |c_old(#memory_$Pointer$.base)| .cse36 .cse37) .cse8 (store (store (select (store .cse38 .cse36 .cse37) .cse8) (_ bv4 32) .cse39) (_ bv8 32) (_ bv3 32)))))) (store .cse35 (_ bv3 32) (store (select .cse35 (_ bv3 32)) (_ bv0 32) .cse8)))))) .cse1 .cse0 .cse2 .cse3) (and (or (and .cse43 .cse1 .cse2 .cse4) (and .cse5 .cse1 .cse2 (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (_ bv4 32) (select v_DerPreprocessor_3 (_ bv0 32))) (= (select (store (store (store |c_#memory_$Pointer$.offset| .cse36 v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) (_ bv3 32) v_DerPreprocessor_3) .cse8) .cse7))) .cse3)) .cse0) (and .cse44 .cse2 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse45 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse45 (_ bv0 32))) (not (= __ldv_list_add_~next.offset (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse46 (let ((.cse47 (store .cse40 .cse45 (select .cse42 .cse45)))) (store (store |c_old(#memory_$Pointer$.base)| .cse36 .cse47) .cse8 (store (store (select (store .cse38 .cse36 .cse47) .cse8) (_ bv4 32) .cse39) (_ bv8 32) (_ bv3 32)))))) (store .cse46 (_ bv3 32) (store (select .cse46 (_ bv3 32)) (_ bv0 32) .cse8)))))))) (and .cse0 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (not (= __ldv_list_add_~next.offset (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse48 (let ((.cse49 (let ((.cse50 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse40 .cse50 (select .cse42 .cse50))))) (store (store |c_old(#memory_$Pointer$.base)| .cse36 .cse49) .cse8 (store (store (select (store .cse38 .cse36 .cse49) .cse8) (_ bv4 32) .cse39) (_ bv8 32) (_ bv3 32)))))) (store .cse48 (_ bv3 32) (store (select .cse48 (_ bv3 32)) (_ bv0 32) .cse8)))))) .cse2 .cse3) (and (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse51 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse51 (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse52 (let ((.cse53 (store .cse40 .cse51 (select .cse42 .cse51)))) (store (store |c_old(#memory_$Pointer$.base)| .cse36 .cse53) .cse8 (store (store (select (store .cse38 .cse36 .cse53) .cse8) (_ bv4 32) .cse39) (_ bv8 32) (_ bv3 32)))))) (store .cse52 (_ bv3 32) (store (select .cse52 (_ bv3 32)) (_ bv0 32) .cse8))))))) .cse44 .cse1 .cse2)))))))))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#mutexes~0.offset| (_ bv0 32))) is different from false [2023-11-06 22:41:53,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802294198] [2023-11-06 22:41:53,596 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:41:53,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:53,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:53,814 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Unexpected substitution problem. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 22:41:53,819 INFO L158 Benchmark]: Toolchain (without parser) took 125339.45ms. Allocated memory was 81.8MB in the beginning and 132.1MB in the end (delta: 50.3MB). Free memory was 56.3MB in the beginning and 86.9MB in the end (delta: -30.6MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2023-11-06 22:41:53,819 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 81.8MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:41:53,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 762.07ms. Allocated memory is still 81.8MB. Free memory was 56.1MB in the beginning and 54.8MB in the end (delta: 1.3MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2023-11-06 22:41:53,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.96ms. Allocated memory is still 81.8MB. Free memory was 54.8MB in the beginning and 52.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:41:53,820 INFO L158 Benchmark]: Boogie Preprocessor took 48.27ms. Allocated memory is still 81.8MB. Free memory was 52.2MB in the beginning and 49.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:41:53,824 INFO L158 Benchmark]: RCFGBuilder took 814.77ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 49.5MB in the beginning and 78.8MB in the end (delta: -29.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-11-06 22:41:53,826 INFO L158 Benchmark]: TraceAbstraction took 123640.60ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 78.2MB in the beginning and 86.9MB in the end (delta: -8.7MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2023-11-06 22:41:53,832 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 81.8MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 762.07ms. Allocated memory is still 81.8MB. Free memory was 56.1MB in the beginning and 54.8MB in the end (delta: 1.3MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.96ms. Allocated memory is still 81.8MB. Free memory was 54.8MB in the beginning and 52.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.27ms. Allocated memory is still 81.8MB. Free memory was 52.2MB in the beginning and 49.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 814.77ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 49.5MB in the beginning and 78.8MB in the end (delta: -29.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 123640.60ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 78.2MB in the beginning and 86.9MB in the end (delta: -8.7MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Unexpected substitution problem. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Unexpected substitution problem.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:305) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:41:53,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fcb4428-aec0-4d9e-9c5c-1a92875d6e0a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Unexpected substitution problem.