./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex.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_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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_57969f56-fc83-4684-aa8e-73854899afe9/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 cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:13:44,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:13:44,937 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:13:44,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:13:44,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:13:44,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:13:44,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:13:44,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:13:44,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:13:44,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:13:44,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:13:44,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:13:44,994 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:13:44,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:13:44,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:13:44,997 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:13:44,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:13:44,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:13:44,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:13:44,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:13:44,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:13:44,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:13:45,000 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:13:45,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:13:45,000 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:13:45,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:13:45,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:13:45,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:13:45,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:45,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:13:45,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:13:45,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:13:45,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:13:45,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:13:45,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:13:45,005 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:13:45,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:13:45,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:13:45,005 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:13:45,006 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_57969f56-fc83-4684-aa8e-73854899afe9/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_57969f56-fc83-4684-aa8e-73854899afe9/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 -> cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 [2023-11-06 22:13:45,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:13:45,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:13:45,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:13:45,340 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:13:45,341 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:13:45,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-sets/test_mutex.i [2023-11-06 22:13:48,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:13:48,731 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:13:48,731 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i [2023-11-06 22:13:48,757 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/data/f0542ec13/1b2c37e29e6348d7a64d1461b4e1ca5a/FLAG0c41c7563 [2023-11-06 22:13:48,771 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/data/f0542ec13/1b2c37e29e6348d7a64d1461b4e1ca5a [2023-11-06 22:13:48,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:13:48,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:13:48,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:48,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:13:48,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:13:48,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:48" (1/1) ... [2023-11-06 22:13:48,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b1cc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:48, skipping insertion in model container [2023-11-06 22:13:48,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:48" (1/1) ... [2023-11-06 22:13:48,869 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:13:49,255 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2023-11-06 22:13:49,261 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2023-11-06 22:13:49,263 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2023-11-06 22:13:49,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:49,277 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:13:49,339 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2023-11-06 22:13:49,346 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2023-11-06 22:13:49,347 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2023-11-06 22:13:49,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:49,405 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:13:49,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49 WrapperNode [2023-11-06 22:13:49,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:49,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:49,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:13:49,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:13:49,417 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:13:49" (1/1) ... [2023-11-06 22:13:49,457 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:13:49" (1/1) ... [2023-11-06 22:13:49,488 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 138 [2023-11-06 22:13:49,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:49,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:13:49,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:13:49,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:13:49,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (1/1) ... [2023-11-06 22:13:49,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (1/1) ... [2023-11-06 22:13:49,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (1/1) ... [2023-11-06 22:13:49,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (1/1) ... [2023-11-06 22:13:49,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (1/1) ... [2023-11-06 22:13:49,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (1/1) ... [2023-11-06 22:13:49,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (1/1) ... [2023-11-06 22:13:49,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (1/1) ... [2023-11-06 22:13:49,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:13:49,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:13:49,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:13:49,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:13:49,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (1/1) ... [2023-11-06 22:13:49,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:49,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:13:49,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:13:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-11-06 22:13:49,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-11-06 22:13:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-11-06 22:13:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-11-06 22:13:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:13:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-11-06 22:13:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-11-06 22:13:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:13:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:13:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-11-06 22:13:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-11-06 22:13:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:13:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:13:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:13:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:13:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-11-06 22:13:49,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-11-06 22:13:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:13:49,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:13:49,772 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:13:49,775 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:13:50,128 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:13:50,135 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:13:50,136 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:13:50,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:50 BoogieIcfgContainer [2023-11-06 22:13:50,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:13:50,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:13:50,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:13:50,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:13:50,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:13:48" (1/3) ... [2023-11-06 22:13:50,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39de6c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:50, skipping insertion in model container [2023-11-06 22:13:50,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:49" (2/3) ... [2023-11-06 22:13:50,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39de6c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:50, skipping insertion in model container [2023-11-06 22:13:50,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:50" (3/3) ... [2023-11-06 22:13:50,148 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex.i [2023-11-06 22:13:50,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:13:50,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-06 22:13:50,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:13:50,226 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;@46ac1214, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:13:50,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-06 22:13:50,231 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:13:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:13:50,238 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:50,239 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:13:50,239 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:13:50,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:50,245 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2023-11-06 22:13:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:50,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800142701] [2023-11-06 22:13:50,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:50,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:13:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:13:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,593 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:13:50,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800142701] [2023-11-06 22:13:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800142701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:13:50,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960160883] [2023-11-06 22:13:50,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:50,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:13:50,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:50,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:13:50,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:13:50,663 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:13:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:50,900 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2023-11-06 22:13:50,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:13:50,904 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:13:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:50,916 INFO L225 Difference]: With dead ends: 147 [2023-11-06 22:13:50,916 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:13:50,922 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:13:50,927 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:13:50,928 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:13:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:13:50,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2023-11-06 22:13:50,985 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:13:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-11-06 22:13:50,992 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2023-11-06 22:13:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:50,992 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-11-06 22:13:50,993 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:13:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-11-06 22:13:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:13:50,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:50,995 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:13:50,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:13:50,996 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:13:50,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2023-11-06 22:13:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068503429] [2023-11-06 22:13:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:51,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:13:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:13:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:51,310 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:13:51,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:51,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068503429] [2023-11-06 22:13:51,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068503429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:51,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:51,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:13:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275284988] [2023-11-06 22:13:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:51,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:13:51,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:51,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:13:51,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:13:51,314 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:13:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:51,561 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-11-06 22:13:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:13:51,562 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:13:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:51,564 INFO L225 Difference]: With dead ends: 82 [2023-11-06 22:13:51,564 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:13:51,565 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:13:51,566 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:13:51,567 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:13:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:13:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2023-11-06 22:13:51,578 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:13:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-11-06 22:13:51,580 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2023-11-06 22:13:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:51,580 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-11-06 22:13:51,581 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:13:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-11-06 22:13:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:13:51,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:51,582 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:13:51,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:13:51,582 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:13:51,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2023-11-06 22:13:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:51,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442035297] [2023-11-06 22:13:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:51,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:13:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:52,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:13:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:52,121 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:13:52,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442035297] [2023-11-06 22:13:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442035297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:13:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482197278] [2023-11-06 22:13:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:52,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:13:52,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:52,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:13:52,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:13:52,131 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:13:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:52,775 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2023-11-06 22:13:52,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:13:52,776 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:13:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:52,786 INFO L225 Difference]: With dead ends: 206 [2023-11-06 22:13:52,786 INFO L226 Difference]: Without dead ends: 145 [2023-11-06 22:13:52,788 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:13:52,789 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.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:52,790 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.4s Time] [2023-11-06 22:13:52,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-06 22:13:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2023-11-06 22:13:52,823 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:13:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-11-06 22:13:52,832 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2023-11-06 22:13:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:52,833 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-11-06 22:13:52,833 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:13:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-11-06 22:13:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:13:52,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:52,839 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:13:52,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:13:52,840 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:13:52,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2023-11-06 22:13:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:52,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999408713] [2023-11-06 22:13:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:13:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:13:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:13:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:53,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:53,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:13:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:13:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:53,095 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:13:53,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:53,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999408713] [2023-11-06 22:13:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999408713] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:53,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397870437] [2023-11-06 22:13:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:53,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:53,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:53,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:53,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:13:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:53,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:13:53,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:53,315 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:13:53,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:13:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397870437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:13:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-06 22:13:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320283456] [2023-11-06 22:13:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:53,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:13:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:53,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:13:53,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:13:53,319 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:13:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:53,344 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2023-11-06 22:13:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:13:53,345 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:13:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:53,347 INFO L225 Difference]: With dead ends: 219 [2023-11-06 22:13:53,348 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:13:53,349 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:13:53,350 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:13:53,351 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:13:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:13:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-06 22:13:53,369 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:13:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2023-11-06 22:13:53,371 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2023-11-06 22:13:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:53,371 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2023-11-06 22:13:53,372 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:13:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2023-11-06 22:13:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:13:53,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:53,374 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:13:53,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:13:53,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:53,583 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:13:53,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2023-11-06 22:13:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:53,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102071706] [2023-11-06 22:13:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:56,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:13:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:57,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:13:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:13:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:13:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:13:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:59,037 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:13:59,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102071706] [2023-11-06 22:13:59,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102071706] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:59,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827955631] [2023-11-06 22:13:59,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:59,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:59,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:59,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:59,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:13:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:59,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 150 conjunts are in the unsatisfiable core [2023-11-06 22:13:59,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:59,596 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:13:59,597 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:14:00,008 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-06 22:14:00,009 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:14:01,267 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:14:01,502 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:14:01,527 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:14:01,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:01,574 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:14:01,578 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:14:01,592 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:14:01,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:01,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:14:01,624 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:14:01,646 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:14:01,669 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:14:01,685 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:14:01,713 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:14:01,728 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:14:01,757 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:14:01,763 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:01,767 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:14:01,778 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:14:19,805 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:14:19,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:14:20,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:20,012 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:14:20,016 INFO L158 Benchmark]: Toolchain (without parser) took 31240.53ms. Allocated memory was 167.8MB in the beginning and 356.5MB in the end (delta: 188.7MB). Free memory was 124.7MB in the beginning and 231.0MB in the end (delta: -106.3MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2023-11-06 22:14:20,017 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:14:20,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.90ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 120.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:20,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.67ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 118.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:14:20,020 INFO L158 Benchmark]: Boogie Preprocessor took 40.37ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:14:20,021 INFO L158 Benchmark]: RCFGBuilder took 607.55ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 95.2MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 22:14:20,021 INFO L158 Benchmark]: TraceAbstraction took 29874.97ms. Allocated memory was 167.8MB in the beginning and 356.5MB in the end (delta: 188.7MB). Free memory was 94.2MB in the beginning and 231.0MB in the end (delta: -136.8MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2023-11-06 22:14:20,026 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.27ms. Allocated memory is still 117.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.90ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 120.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.67ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 118.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.37ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 607.55ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 95.2MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 29874.97ms. Allocated memory was 167.8MB in the beginning and 356.5MB in the end (delta: 188.7MB). Free memory was 94.2MB in the beginning and 231.0MB in the end (delta: -136.8MB). Peak memory consumption was 53.6MB. 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:14:20,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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_57969f56-fc83-4684-aa8e-73854899afe9/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 cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:14:22,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:14:22,770 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:14:22,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:14:22,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:14:22,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:14:22,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:14:22,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:14:22,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:14:22,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:14:22,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:14:22,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:14:22,840 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:14:22,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:14:22,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:14:22,844 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:14:22,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:14:22,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:14:22,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:14:22,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:14:22,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:14:22,846 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:14:22,846 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:14:22,847 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:14:22,847 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:14:22,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:14:22,848 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:14:22,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:14:22,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:14:22,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:14:22,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:22,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:14:22,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:14:22,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:14:22,852 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:14:22,852 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:14:22,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:14:22,852 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:14:22,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:14:22,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:14:22,854 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:14:22,854 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:14:22,854 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_57969f56-fc83-4684-aa8e-73854899afe9/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_57969f56-fc83-4684-aa8e-73854899afe9/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 -> cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 [2023-11-06 22:14:23,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:14:23,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:14:23,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:14:23,305 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:14:23,305 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:14:23,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-sets/test_mutex.i [2023-11-06 22:14:26,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:14:26,847 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:14:26,848 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i [2023-11-06 22:14:26,866 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/data/a232631b8/3ed9344a5b0e4b04a6fab329c3c5efd9/FLAGc8d518cd7 [2023-11-06 22:14:26,886 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/data/a232631b8/3ed9344a5b0e4b04a6fab329c3c5efd9 [2023-11-06 22:14:26,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:14:26,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:14:26,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:26,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:14:26,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:14:26,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:26" (1/1) ... [2023-11-06 22:14:26,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563b838c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:26, skipping insertion in model container [2023-11-06 22:14:26,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:26" (1/1) ... [2023-11-06 22:14:26,977 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:14:27,439 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2023-11-06 22:14:27,448 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2023-11-06 22:14:27,449 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2023-11-06 22:14:27,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:27,474 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-06 22:14:27,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:14:27,555 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2023-11-06 22:14:27,559 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2023-11-06 22:14:27,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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2023-11-06 22:14:27,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:27,571 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:14:27,646 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2023-11-06 22:14:27,659 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2023-11-06 22:14:27,660 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_57969f56-fc83-4684-aa8e-73854899afe9/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2023-11-06 22:14:27,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:27,727 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:14:27,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27 WrapperNode [2023-11-06 22:14:27,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:27,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:27,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:14:27,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:14:27,736 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:14:27" (1/1) ... [2023-11-06 22:14:27,771 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:14:27" (1/1) ... [2023-11-06 22:14:27,812 INFO L138 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 134 [2023-11-06 22:14:27,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:27,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:14:27,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:14:27,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:14:27,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (1/1) ... [2023-11-06 22:14:27,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (1/1) ... [2023-11-06 22:14:27,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (1/1) ... [2023-11-06 22:14:27,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (1/1) ... [2023-11-06 22:14:27,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (1/1) ... [2023-11-06 22:14:27,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (1/1) ... [2023-11-06 22:14:27,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (1/1) ... [2023-11-06 22:14:27,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (1/1) ... [2023-11-06 22:14:27,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:14:27,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:14:27,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:14:27,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:14:27,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (1/1) ... [2023-11-06 22:14:27,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:27,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:27,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:27,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-11-06 22:14:27,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-11-06 22:14:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-11-06 22:14:27,992 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-11-06 22:14:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:14:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-11-06 22:14:27,993 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-11-06 22:14:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:14:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:14:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-11-06 22:14:27,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-11-06 22:14:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:14:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:14:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:14:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:14:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-11-06 22:14:27,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-11-06 22:14:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:14:27,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:14:28,164 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:14:28,166 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:14:28,712 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:14:28,724 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:14:28,728 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:14:28,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:28 BoogieIcfgContainer [2023-11-06 22:14:28,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:14:28,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:14:28,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:14:28,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:14:28,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:14:26" (1/3) ... [2023-11-06 22:14:28,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b546b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:28, skipping insertion in model container [2023-11-06 22:14:28,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:27" (2/3) ... [2023-11-06 22:14:28,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b546b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:28, skipping insertion in model container [2023-11-06 22:14:28,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:28" (3/3) ... [2023-11-06 22:14:28,745 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex.i [2023-11-06 22:14:28,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:14:28,767 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-06 22:14:28,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:28,839 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;@719aaedf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:28,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-06 22:14:28,845 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:14:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:14:28,854 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:28,855 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:14:28,856 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:14:28,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2023-11-06 22:14:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:14:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254406797] [2023-11-06 22:14:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:28,877 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:14:28,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:14:28,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:28,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:29,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:14:29,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:29,111 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:14:29,111 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:14:29,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:14:29,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254406797] [2023-11-06 22:14:29,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254406797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:29,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:29,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:14:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018460304] [2023-11-06 22:14:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:29,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:14:29,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:14:29,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:14:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:14:29,153 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:14:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:29,184 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2023-11-06 22:14:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:14:29,186 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:14:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:29,202 INFO L225 Difference]: With dead ends: 130 [2023-11-06 22:14:29,202 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 22:14:29,206 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:14:29,210 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:14:29,211 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:14:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 22:14:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-06 22:14:29,251 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:14:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-11-06 22:14:29,255 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2023-11-06 22:14:29,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:29,255 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-11-06 22:14:29,256 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:14:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-11-06 22:14:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:14:29,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:29,258 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:14:29,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:29,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:29,471 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:14:29,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2023-11-06 22:14:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:14:29,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141665611] [2023-11-06 22:14:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:29,474 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:14:29,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:14:29,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:29,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:29,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:14:29,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:30,203 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:14:30,203 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:14:30,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:14:30,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141665611] [2023-11-06 22:14:30,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141665611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:30,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:30,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:14:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200206060] [2023-11-06 22:14:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:30,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:30,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:14:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:30,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:30,216 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:14:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:30,861 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2023-11-06 22:14:30,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:14:30,862 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:14:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:30,866 INFO L225 Difference]: With dead ends: 170 [2023-11-06 22:14:30,866 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:14:30,867 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:14:30,869 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:14:30,869 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:14:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:14:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2023-11-06 22:14:30,890 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:14:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2023-11-06 22:14:30,892 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2023-11-06 22:14:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:30,892 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2023-11-06 22:14:30,893 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:14:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2023-11-06 22:14:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:14:30,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:30,894 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:14:30,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:31,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:31,107 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:14:31,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2023-11-06 22:14:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:14:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747106072] [2023-11-06 22:14:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:31,109 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:14:31,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:14:31,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:31,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:14:31,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:31,286 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:14:31,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:14:31,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:14:31,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747106072] [2023-11-06 22:14:31,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747106072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:31,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:31,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:14:31,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040397312] [2023-11-06 22:14:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:31,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:14:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:14:31,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:14:31,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:14:31,290 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:14:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:31,311 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2023-11-06 22:14:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:14:31,312 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:14:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:31,314 INFO L225 Difference]: With dead ends: 108 [2023-11-06 22:14:31,314 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:14:31,315 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:14:31,316 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:14:31,317 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:14:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:14:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2023-11-06 22:14:31,334 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:14:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2023-11-06 22:14:31,336 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2023-11-06 22:14:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:31,337 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2023-11-06 22:14:31,337 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:14:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2023-11-06 22:14:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:14:31,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:31,341 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:14:31,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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)] Ended with exit code 0 [2023-11-06 22:14:31,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:31,552 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:14:31,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:31,553 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2023-11-06 22:14:31,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:14:31,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182025004] [2023-11-06 22:14:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:31,555 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:14:31,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:14:31,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:31,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:31,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:14:31,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:31,929 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:14:31,933 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:14:32,248 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:14:32,248 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:14:32,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:14:32,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182025004] [2023-11-06 22:14:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182025004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:32,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:14:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212114963] [2023-11-06 22:14:32,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:32,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:14:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:14:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:14:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:14:32,252 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:14:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:34,682 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2023-11-06 22:14:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:14:34,683 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:14:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:34,686 INFO L225 Difference]: With dead ends: 268 [2023-11-06 22:14:34,687 INFO L226 Difference]: Without dead ends: 162 [2023-11-06 22:14:34,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:14:34,689 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:14:34,690 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:14:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-06 22:14:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2023-11-06 22:14:34,712 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:14:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2023-11-06 22:14:34,714 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2023-11-06 22:14:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:34,715 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2023-11-06 22:14:34,715 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:14:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2023-11-06 22:14:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:14:34,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:34,718 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:14:34,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:34,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:34,954 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:14:34,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2023-11-06 22:14:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:14:34,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052081077] [2023-11-06 22:14:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:34,955 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:14:34,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:14:34,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:34,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:14:35,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:35,174 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:14:35,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:14:35,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:14:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052081077] [2023-11-06 22:14:35,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052081077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:35,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:35,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:14:35,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489328497] [2023-11-06 22:14:35,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:35,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:14:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:14:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:14:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:14:35,184 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:14:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:35,225 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2023-11-06 22:14:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:14:35,226 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:14:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:35,231 INFO L225 Difference]: With dead ends: 196 [2023-11-06 22:14:35,231 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 22:14:35,232 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:14:35,235 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:14:35,236 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:14:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 22:14:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-11-06 22:14:35,270 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:14:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2023-11-06 22:14:35,275 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2023-11-06 22:14:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:35,275 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2023-11-06 22:14:35,276 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:14:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2023-11-06 22:14:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:14:35,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:35,280 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:14:35,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:35,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:35,494 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:14:35,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2023-11-06 22:14:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:14:35,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096398854] [2023-11-06 22:14:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:35,495 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:14:35,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:14:35,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:35,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:14:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-06 22:14:35,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:35,852 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:14:36,271 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:14:36,272 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:14:44,037 INFO L322 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-11-06 22:14:44,038 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:14:44,197 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:14:44,371 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:14:45,743 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:14:46,274 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:14:51,474 INFO L322 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2023-11-06 22:14:51,474 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:14:51,694 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-06 22:14:51,694 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:14:51,732 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:14:51,849 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:14:53,949 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse30 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|)) (.cse31 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|))) (let ((.cse5 (not .cse31)) (.cse13 (not .cse30)) (.cse4 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|))) (and (let ((.cse2 (select |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base|)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset|)) (.cse3 (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)))) (let ((.cse0 (= |c_#memory_$Pointer$.base| (let ((.cse48 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base| (store (store .cse2 |c___ldv_list_add_#in~new.offset| .cse9) .cse3 |c___ldv_list_add_#in~prev.base|)))) (store .cse48 |c___ldv_list_add_#in~prev.base| (store (select .cse48 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))))) (.cse23 (not .cse4)) (.cse10 (select |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base|)) (.cse12 (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base|)) (.cse6 (= |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|))) (or (and (or .cse0 (= |c_#memory_$Pointer$.base| (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base| (store .cse2 .cse3 |c___ldv_list_add_#in~prev.base|)))) (store .cse1 |c___ldv_list_add_#in~prev.base| (store (select .cse1 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))))) .cse4) (and (or .cse5 (not .cse6)) (or (and (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse11 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (= |c_#memory_$Pointer$.base| (let ((.cse7 (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse10 .cse11 (select .cse12 .cse11))))) (store .cse8 |c___ldv_list_add_#in~new.base| (store (store (select .cse8 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse9) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse7 |c___ldv_list_add_#in~prev.base| (store (select .cse7 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (not (= |c___ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset)) (not (= |c___ldv_list_add_#in~new.offset| .cse11))))) .cse13) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse16 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (= |c_#memory_$Pointer$.base| (let ((.cse14 (let ((.cse15 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse10 .cse16 (select .cse12 .cse16))))) (store .cse15 |c___ldv_list_add_#in~new.base| (store (store (select .cse15 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse9) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse14 |c___ldv_list_add_#in~prev.base| (store (select .cse14 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (not (= |c___ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset)) (not (= |c___ldv_list_add_#in~new.offset| .cse16)) (not (= |c___ldv_list_add_#in~prev.offset| .cse16))))) (and (or (and .cse13 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse17 (let ((.cse18 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (let ((.cse19 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse10 .cse19 (select .cse12 .cse19)))))) (store .cse18 |c___ldv_list_add_#in~new.base| (store (store (select .cse18 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse9) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse17 |c___ldv_list_add_#in~prev.base| (store (select .cse17 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))))) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse22 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (= |c_#memory_$Pointer$.base| (let ((.cse20 (let ((.cse21 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse10 .cse22 (select .cse12 .cse22))))) (store .cse21 |c___ldv_list_add_#in~new.base| (store (store (select .cse21 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse9) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse20 |c___ldv_list_add_#in~prev.base| (store (select .cse20 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (not (= |c___ldv_list_add_#in~prev.offset| .cse22)))))) .cse23) (and .cse23 (or (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse26 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (= |c_#memory_$Pointer$.base| (let ((.cse24 (let ((.cse25 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse10 .cse26 (select .cse12 .cse26))))) (store .cse25 |c___ldv_list_add_#in~new.base| (store (store (select .cse25 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse9) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse24 |c___ldv_list_add_#in~prev.base| (store (select .cse24 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (not (= |c___ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset)) (not (= |c___ldv_list_add_#in~prev.offset| .cse26))))) (and .cse13 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse27 (let ((.cse28 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (let ((.cse29 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse10 .cse29 (select .cse12 .cse29)))))) (store .cse28 |c___ldv_list_add_#in~new.base| (store (store (select .cse28 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse9) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse27 |c___ldv_list_add_#in~prev.base| (store (select .cse27 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (not (= |c___ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset))))))))) (and .cse30 .cse0) (and .cse31 (let ((.cse32 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse45 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= |c___ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset)) (not (= |c___ldv_list_add_#in~new.offset| .cse45)) (= (let ((.cse46 (let ((.cse47 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse10 .cse45 (select .cse12 .cse45))))) (store .cse47 |c___ldv_list_add_#in~new.base| (store (select .cse47 |c___ldv_list_add_#in~new.base|) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse46 |c___ldv_list_add_#in~prev.base| (store (select .cse46 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))))) (or .cse32 (and .cse32 .cse13) (and .cse23 (or (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (= (let ((.cse33 (let ((.cse34 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (let ((.cse35 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse10 .cse35 (select .cse12 .cse35)))))) (store .cse34 |c___ldv_list_add_#in~new.base| (store (select .cse34 |c___ldv_list_add_#in~new.base|) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse33 |c___ldv_list_add_#in~prev.base| (store (select .cse33 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse36 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= |c___ldv_list_add_#in~prev.offset| .cse36)) (= (let ((.cse37 (let ((.cse38 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse10 .cse36 (select .cse12 .cse36))))) (store .cse38 |c___ldv_list_add_#in~new.base| (store (select .cse38 |c___ldv_list_add_#in~new.base|) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse37 |c___ldv_list_add_#in~prev.base| (store (select .cse37 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))))) (and .cse23 (or (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse39 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= |c___ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset)) (not (= |c___ldv_list_add_#in~prev.offset| .cse39)) (= (let ((.cse40 (let ((.cse41 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse10 .cse39 (select .cse12 .cse39))))) (store .cse41 |c___ldv_list_add_#in~new.base| (store (select .cse41 |c___ldv_list_add_#in~new.base|) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse40 |c___ldv_list_add_#in~prev.base| (store (select .cse40 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (not (= |c___ldv_list_add_#in~new.offset| __ldv_list_add_~next.offset)) (= (let ((.cse42 (let ((.cse43 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (let ((.cse44 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse10 .cse44 (select .cse12 .cse44)))))) (store .cse43 |c___ldv_list_add_#in~new.base| (store (select .cse43 |c___ldv_list_add_#in~new.base|) .cse3 |c___ldv_list_add_#in~prev.base|))))) (store .cse42 |c___ldv_list_add_#in~prev.base| (store (select .cse42 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|))))))) .cse6)))) (let ((.cse66 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|))) (let ((.cse49 (= |c___ldv_list_add_#in~new.offset| (select .cse66 |c___ldv_list_add_#in~prev.offset|)))) (or (and .cse5 (or (and .cse49 .cse13) (and .cse49 .cse30 (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 ((.cse50 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_1) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_3))) (and (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) (select .cse50 |c___ldv_list_add_#in~new.base|)) (= (select .cse50 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_1) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_3 |c___ldv_list_add_#in~prev.offset|)))))))) (and .cse31 (let ((.cse53 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|))) (let ((.cse60 (store .cse53 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|))) (let ((.cse51 (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| .cse60))) (let ((.cse82 (select .cse81 |c___ldv_list_add_#in~next.base|))) (and (= v_DerPreprocessor_8 (select .cse81 |c___ldv_list_add_#in~new.base|)) (= .cse82 v_DerPreprocessor_7) (= .cse82 .cse53)))))) (.cse73 (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9))) (and (= (select .cse80 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_7) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_9 |c___ldv_list_add_#in~prev.offset|)) (= v_DerPreprocessor_8 (select .cse80 |c___ldv_list_add_#in~new.base|))))))) (or (and .cse49 .cse51 (exists ((v_prenex_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_75 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_76 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_75) |c___ldv_list_add_#in~new.base| v_prenex_76) |c___ldv_list_add_#in~prev.base| v_prenex_77))) (let ((.cse52 (select .cse54 |c___ldv_list_add_#in~next.base|))) (and (= |c___ldv_list_add_#in~new.offset| (select v_prenex_77 |c___ldv_list_add_#in~prev.offset|)) (= .cse52 .cse53) (= (select .cse54 |c___ldv_list_add_#in~new.base|) v_prenex_76) (= v_prenex_75 .cse52)))))) (and .cse30 (or (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| .cse60))) (let ((.cse56 (select .cse59 |c___ldv_list_add_#in~new.base|)) (.cse58 (select .cse59 |c___ldv_list_add_#in~next.base|))) (and (exists ((v_prenex_79 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_78 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_80 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_78) |c___ldv_list_add_#in~new.base| v_prenex_79) |c___ldv_list_add_#in~prev.base| v_prenex_80))) (let ((.cse55 (select .cse57 |c___ldv_list_add_#in~new.base|))) (and (= .cse55 .cse56) (= .cse55 v_prenex_79) (= (select .cse57 |c___ldv_list_add_#in~next.base|) v_prenex_78))))) (= v_DerPreprocessor_8 .cse56) (= .cse58 v_DerPreprocessor_7) (= .cse58 .cse53))))) (and .cse51 (exists ((v_prenex_73 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_74 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_72 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_72) |c___ldv_list_add_#in~new.base| v_prenex_73) |c___ldv_list_add_#in~prev.base| v_prenex_74))) (and (= (select .cse61 |c___ldv_list_add_#in~next.base|) v_prenex_72) (= |c___ldv_list_add_#in~new.offset| (select v_prenex_74 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse61 |c___ldv_list_add_#in~new.base|) v_prenex_73))))))) (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| .cse60))) (let ((.cse63 (select .cse68 |c___ldv_list_add_#in~new.base|)) (.cse67 (select .cse68 |c___ldv_list_add_#in~next.base|))) (and (exists ((v_prenex_88 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_89 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_87 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_87) |c___ldv_list_add_#in~new.base| v_prenex_88) |c___ldv_list_add_#in~prev.base| v_prenex_89))) (let ((.cse62 (select .cse65 |c___ldv_list_add_#in~new.base|)) (.cse64 (select .cse65 |c___ldv_list_add_#in~next.base|))) (and (= v_prenex_88 .cse62) (= .cse63 .cse62) (= .cse64 .cse53) (= v_prenex_87 .cse64))))) (= (store .cse63 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse66) (= v_DerPreprocessor_8 .cse63) (= .cse67 v_DerPreprocessor_7) (= .cse67 .cse53))))) (and .cse30 (or (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9))) (let ((.cse70 (select .cse72 |c___ldv_list_add_#in~new.base|))) (and (exists ((v_prenex_86 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_85 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_81 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_81) |c___ldv_list_add_#in~new.base| v_prenex_86) |c___ldv_list_add_#in~prev.base| v_prenex_85))) (let ((.cse71 (select .cse69 |c___ldv_list_add_#in~new.base|))) (and (= v_prenex_81 (select .cse69 |c___ldv_list_add_#in~next.base|)) (= .cse70 .cse71) (= v_prenex_86 .cse71))))) (= (select .cse72 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_7) (= .cse66 (store .cse70 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= v_DerPreprocessor_8 .cse70))))) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_9 |c___ldv_list_add_#in~prev.offset|)))) (and .cse49 .cse73 (exists ((v_prenex_84 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_82 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_83 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_82) |c___ldv_list_add_#in~new.base| v_prenex_83) |c___ldv_list_add_#in~prev.base| v_prenex_84))) (and (= (select .cse74 |c___ldv_list_add_#in~new.base|) v_prenex_83) (= |c___ldv_list_add_#in~new.offset| (select v_prenex_84 |c___ldv_list_add_#in~prev.offset|)) (= v_prenex_82 (select .cse74 |c___ldv_list_add_#in~next.base|)))))))) (and .cse4 (or (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_9 |c___ldv_list_add_#in~prev.offset|)) (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9))) (let ((.cse77 (select .cse78 |c___ldv_list_add_#in~new.base|))) (and (exists ((v_prenex_69 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_71 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_70 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_69) |c___ldv_list_add_#in~new.base| v_prenex_70) |c___ldv_list_add_#in~prev.base| v_prenex_71))) (let ((.cse76 (select .cse75 |c___ldv_list_add_#in~new.base|))) (and (= v_prenex_69 (select .cse75 |c___ldv_list_add_#in~next.base|)) (= .cse76 .cse77) (= .cse76 v_prenex_70))))) (= (select .cse78 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_7) (= .cse66 (store .cse77 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= v_DerPreprocessor_8 .cse77))))))) (and .cse49 .cse73 (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_4) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_5) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_6))) (and (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_6 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse79 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_4) (= (select .cse79 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_5))))))))))))))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#mutexes~0.offset| (_ bv0 32))))) is different from false [2023-11-06 22:15:17,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:17,732 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:15:18,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:18,022 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:15:21,631 WARN L861 $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 true [2023-11-06 22:15:27,577 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse41 (select |c_#memory_$Pointer$.base| (_ bv3 32)))) (let ((.cse10 (select .cse41 (_ bv0 32)))) (let ((.cse60 (store (select |c_old(#memory_$Pointer$.base)| .cse10) (_ bv0 32) |c_mutex_lock_#in~m#1.base|))) (let ((.cse14 (store |c_old(#memory_$Pointer$.base)| .cse10 .cse60))) (let ((.cse12 (select (select .cse14 (_ bv3 32)) (_ bv0 32)))) (let ((.cse21 (select |c_#memory_$Pointer$.offset| (_ bv3 32))) (.cse9 (select |c_#memory_$Pointer$.offset| .cse10)) (.cse8 (= (_ bv3 32) .cse12))) (let ((.cse0 (= .cse12 .cse10)) (.cse5 (not .cse8)) (.cse42 (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 ((.cse61 (store (store (store |c_#memory_$Pointer$.offset| .cse12 v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) (_ bv3 32) v_DerPreprocessor_3))) (and (= (_ bv4 32) (select v_DerPreprocessor_3 (_ bv0 32))) (= v_DerPreprocessor_1 (select .cse61 .cse12)) (= (select .cse61 .cse10) .cse9))))) (.cse1 (= (_ bv4 32) (select .cse21 (_ bv0 32)))) (.cse16 (select .cse14 .cse12)) (.cse18 (select |c_#memory_$Pointer$.base| .cse12)) (.cse15 (select (select |c_#memory_$Pointer$.base| .cse10) (_ bv4 32)))) (let ((.cse2 (= (let ((.cse59 (store |c_old(#memory_$Pointer$.base)| .cse10 (store (store .cse60 (_ bv4 32) .cse15) (_ bv8 32) (_ bv3 32))))) (store .cse59 (_ bv3 32) (store (select .cse59 (_ bv3 32)) (_ bv0 32) .cse10))) |c_#memory_$Pointer$.base|)) (.cse6 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse56 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse56 (_ bv0 32))) (= |c_#memory_$Pointer$.base| (let ((.cse57 (let ((.cse58 (store .cse16 .cse56 (select .cse18 .cse56)))) (store (store |c_old(#memory_$Pointer$.base)| .cse12 .cse58) .cse10 (store (store (select (store .cse14 .cse12 .cse58) .cse10) (_ bv4 32) .cse15) (_ bv8 32) (_ bv3 32)))))) (store .cse57 (_ bv3 32) (store (select .cse57 (_ bv3 32)) (_ bv0 32) .cse10)))))))) (.cse7 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse53 (let ((.cse54 (let ((.cse55 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse16 .cse55 (select .cse18 .cse55))))) (store (store |c_old(#memory_$Pointer$.base)| .cse12 .cse54) .cse10 (store (store (select (store .cse14 .cse12 .cse54) .cse10) (_ bv4 32) .cse15) (_ bv8 32) (_ bv3 32)))))) (store .cse53 (_ bv3 32) (store (select .cse53 (_ bv3 32)) (_ bv0 32) .cse10)))))) (.cse43 (or (and .cse1 .cse5) (and .cse42 .cse1))) (.cse3 (not .cse0)) (.cse4 (not (= (_ bv3 32) .cse10)))) (or (and .cse0 .cse1 .cse2) (and .cse1 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse3 .cse4 .cse5))) (and .cse8 (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))) (= .cse9 (select (store (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_2) (_ bv3 32) v_DerPreprocessor_1) .cse10)))) .cse1 .cse2) (and (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse11 (let ((.cse13 (let ((.cse17 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse16 .cse17 (select .cse18 .cse17))))) (store (store |c_old(#memory_$Pointer$.base)| .cse12 .cse13) .cse10 (store (store (select (store .cse14 .cse12 .cse13) .cse10) (_ bv4 32) .cse15) (_ bv8 32) (_ bv3 32)))))) (store .cse11 (_ bv3 32) (store (select .cse11 (_ bv3 32)) (_ bv0 32) .cse10)))))) .cse3 .cse1 .cse4 .cse5) (let ((.cse23 (= (_ bv3 32) |c_mutex_lock_#in~m#1.base|))) (and (let ((.cse20 (select |c_#memory_$Pointer$.offset| |c_mutex_lock_#in~m#1.base|))) (let ((.cse19 (store .cse20 (_ bv0 32) (_ bv4 32)))) (let ((.cse22 (exists ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse20 (select (store (store |c_#memory_$Pointer$.offset| |c_mutex_lock_#in~m#1.base| v_DerPreprocessor_7) (_ bv3 32) .cse19) |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) .cse19) |c_mutex_lock_#in~m#1.base|) .cse20)) (= .cse21 .cse19) .cse22) (and (exists ((v_prenex_75 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_76 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse20 (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))))) .cse1 .cse22) (and .cse23 .cse1))))) (let ((.cse25 (store |c_old(#memory_$Pointer$.base)| (_ bv3 32) (store (select |c_old(#memory_$Pointer$.base)| (_ bv3 32)) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse26 (select .cse41 (_ bv4 32))) (.cse27 (select .cse25 |c_mutex_lock_#in~m#1.base|)) (.cse29 (select |c_#memory_$Pointer$.base| |c_mutex_lock_#in~m#1.base|)) (.cse30 (not .cse23))) (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 ((.cse24 (let ((.cse28 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse27 .cse28 (select .cse29 .cse28))))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse24) (_ bv3 32) (store (store (store (select (store .cse25 |c_mutex_lock_#in~m#1.base| .cse24) (_ bv3 32)) (_ bv4 32) .cse26) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32))))))) .cse30) (and .cse30 (or (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse31 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse31 (_ bv0 32))) (= |c_#memory_$Pointer$.base| (let ((.cse32 (store .cse27 .cse31 (select .cse29 .cse31)))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse32) (_ bv3 32) (store (store (store (select (store .cse25 |c_mutex_lock_#in~m#1.base| .cse32) (_ bv3 32)) (_ bv4 32) .cse26) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32)))))))) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse33 (let ((.cse34 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse27 .cse34 (select .cse29 .cse34))))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse33) (_ bv3 32) (store (store (store (select (store .cse25 |c_mutex_lock_#in~m#1.base| .cse33) (_ bv3 32)) (_ bv4 32) .cse26) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32)))))))) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse35 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse35 (_ bv0 32))) (not (= __ldv_list_add_~next.offset (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse36 (store .cse27 .cse35 (select .cse29 .cse35)))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse36) (_ bv3 32) (store (store (store (select (store .cse25 |c_mutex_lock_#in~m#1.base| .cse36) (_ bv3 32)) (_ bv4 32) .cse26) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32)))))))) (and (or (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse37 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse37 (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse38 (store .cse27 .cse37 (select .cse29 .cse37)))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse38) (_ bv3 32) (store (store (store (select (store .cse25 |c_mutex_lock_#in~m#1.base| .cse38) (_ bv3 32)) (_ bv4 32) .cse26) (_ 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 ((.cse39 (let ((.cse40 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse27 .cse40 (select .cse29 .cse40))))) (store (store |c_old(#memory_$Pointer$.base)| |c_mutex_lock_#in~m#1.base| .cse39) (_ bv3 32) (store (store (store (select (store .cse25 |c_mutex_lock_#in~m#1.base| .cse39) (_ bv3 32)) (_ bv4 32) .cse26) (_ bv8 32) (_ bv3 32)) (_ bv0 32) (_ bv3 32)))))))) .cse30)))))) (and (or (and .cse42 .cse3 .cse4 .cse6) (and .cse7 .cse3 .cse4 (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| .cse12 v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) (_ bv3 32) v_DerPreprocessor_3) .cse10) .cse9))) .cse5)) .cse1) (and .cse43 .cse4 (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse44 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse44 (_ bv0 32))) (not (= __ldv_list_add_~next.offset (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse45 (let ((.cse46 (store .cse16 .cse44 (select .cse18 .cse44)))) (store (store |c_old(#memory_$Pointer$.base)| .cse12 .cse46) .cse10 (store (store (select (store .cse14 .cse12 .cse46) .cse10) (_ bv4 32) .cse15) (_ bv8 32) (_ bv3 32)))))) (store .cse45 (_ bv3 32) (store (select .cse45 (_ bv3 32)) (_ bv0 32) .cse10)))))))) (and .cse1 (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 ((.cse47 (let ((.cse48 (let ((.cse49 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (store .cse16 .cse49 (select .cse18 .cse49))))) (store (store |c_old(#memory_$Pointer$.base)| .cse12 .cse48) .cse10 (store (store (select (store .cse14 .cse12 .cse48) .cse10) (_ bv4 32) .cse15) (_ bv8 32) (_ bv3 32)))))) (store .cse47 (_ bv3 32) (store (select .cse47 (_ bv3 32)) (_ bv0 32) .cse10)))))) .cse4 .cse5) (and (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse50 (bvadd (_ bv4 32) __ldv_list_add_~next.offset))) (and (not (= .cse50 (_ bv0 32))) (not (= (_ bv4 32) __ldv_list_add_~next.offset)) (= |c_#memory_$Pointer$.base| (let ((.cse51 (let ((.cse52 (store .cse16 .cse50 (select .cse18 .cse50)))) (store (store |c_old(#memory_$Pointer$.base)| .cse12 .cse52) .cse10 (store (store (select (store .cse14 .cse12 .cse52) .cse10) (_ bv4 32) .cse15) (_ bv8 32) (_ bv3 32)))))) (store .cse51 (_ bv3 32) (store (select .cse51 (_ bv3 32)) (_ bv0 32) .cse10))))))) .cse43 .cse3 .cse4)))))))))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#mutexes~0.offset| (_ bv0 32))) is different from false [2023-11-06 22:15:39,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:15:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096398854] [2023-11-06 22:15:39,050 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:15:39,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:15:39,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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:15:39,274 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:15:39,278 INFO L158 Benchmark]: Toolchain (without parser) took 72388.71ms. Allocated memory was 81.8MB in the beginning and 125.8MB in the end (delta: 44.0MB). Free memory was 56.0MB in the beginning and 30.8MB in the end (delta: 25.2MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2023-11-06 22:15:39,278 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 57.2MB in the end (delta: 20.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:15:39,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 837.15ms. Allocated memory is still 81.8MB. Free memory was 55.8MB in the beginning and 53.4MB in the end (delta: 2.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:15:39,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.75ms. Allocated memory is still 81.8MB. Free memory was 53.4MB in the beginning and 51.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:15:39,279 INFO L158 Benchmark]: Boogie Preprocessor took 89.38ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 48.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:15:39,283 INFO L158 Benchmark]: RCFGBuilder took 828.24ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 48.2MB in the beginning and 71.2MB in the end (delta: -23.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2023-11-06 22:15:39,284 INFO L158 Benchmark]: TraceAbstraction took 70541.33ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 70.7MB in the beginning and 30.8MB in the end (delta: 39.8MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2023-11-06 22:15:39,291 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.23ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 57.2MB in the end (delta: 20.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 837.15ms. Allocated memory is still 81.8MB. Free memory was 55.8MB in the beginning and 53.4MB in the end (delta: 2.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.75ms. Allocated memory is still 81.8MB. Free memory was 53.4MB in the beginning and 51.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.38ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 48.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 828.24ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 48.2MB in the beginning and 71.2MB in the end (delta: -23.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 70541.33ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 70.7MB in the beginning and 30.8MB in the end (delta: 39.8MB). Peak memory consumption was 66.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:15:39,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57969f56-fc83-4684-aa8e-73854899afe9/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.