./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.2-?-6c24879 [2022-07-12 03:26:39,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:26:39,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:26:39,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:26:39,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:26:39,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:26:39,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:26:39,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:26:39,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:26:39,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:26:39,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:26:39,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:26:39,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:26:39,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:26:39,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:26:39,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:26:39,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:26:39,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:26:39,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:26:39,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:26:39,432 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:26:39,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:26:39,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:26:39,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:26:39,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:26:39,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:26:39,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:26:39,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:26:39,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:26:39,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:26:39,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:26:39,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:26:39,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:26:39,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:26:39,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:26:39,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:26:39,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:26:39,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:26:39,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:26:39,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:26:39,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:26:39,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:26:39,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:26:39,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:26:39,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:26:39,476 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:26:39,476 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:26:39,477 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:26:39,477 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:26:39,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:26:39,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:26:39,477 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:26:39,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:26:39,478 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:26:39,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:26:39,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:26:39,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:26:39,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:26:39,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:26:39,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:26:39,479 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:26:39,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:26:39,480 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:26:39,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:26:39,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:26:39,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:26:39,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:26:39,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:26:39,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:26:39,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:26:39,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:26:39,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:26:39,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:26:39,481 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:26:39,482 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:26:39,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:26:39,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2022-07-12 03:26:39,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:26:39,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:26:39,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:26:39,712 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:26:39,713 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:26:39,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex.i [2022-07-12 03:26:39,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fbf91ab5/d68c59635815423a898dc34865d1cdea/FLAGbbc847792 [2022-07-12 03:26:40,148 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:26:40,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i [2022-07-12 03:26:40,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fbf91ab5/d68c59635815423a898dc34865d1cdea/FLAGbbc847792 [2022-07-12 03:26:40,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fbf91ab5/d68c59635815423a898dc34865d1cdea [2022-07-12 03:26:40,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:26:40,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:26:40,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:40,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:26:40,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:26:40,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c17e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40, skipping insertion in model container [2022-07-12 03:26:40,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:26:40,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:26:40,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2022-07-12 03:26:40,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2022-07-12 03:26:40,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2022-07-12 03:26:40,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:40,787 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:26:40,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2022-07-12 03:26:40,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2022-07-12 03:26:40,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2022-07-12 03:26:40,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:40,837 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:26:40,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40 WrapperNode [2022-07-12 03:26:40,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:40,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:40,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:26:40,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:26:40,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,878 INFO L137 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 129 [2022-07-12 03:26:40,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:40,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:26:40,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:26:40,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:26:40,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:26:40,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:26:40,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:26:40,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:26:40,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (1/1) ... [2022-07-12 03:26:40,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:26:40,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:26:40,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:26:40,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:26:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-12 03:26:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-12 03:26:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 03:26:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 03:26:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:26:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-12 03:26:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-12 03:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-12 03:26:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-12 03:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-12 03:26:40,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-12 03:26:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:26:40,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:26:41,056 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:26:41,058 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:26:41,247 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:26:41,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:26:41,260 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:26:41,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:26:41 BoogieIcfgContainer [2022-07-12 03:26:41,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:26:41,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:26:41,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:26:41,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:26:41,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:26:40" (1/3) ... [2022-07-12 03:26:41,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e49cd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:26:41, skipping insertion in model container [2022-07-12 03:26:41,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:40" (2/3) ... [2022-07-12 03:26:41,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e49cd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:26:41, skipping insertion in model container [2022-07-12 03:26:41,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:26:41" (3/3) ... [2022-07-12 03:26:41,268 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex.i [2022-07-12 03:26:41,278 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:26:41,278 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-12 03:26:41,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:26:41,331 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2af86f5a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70b62bfe [2022-07-12 03:26:41,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 03:26:41,336 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) [2022-07-12 03:26:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:26:41,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:41,341 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] [2022-07-12 03:26:41,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:41,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:41,346 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2022-07-12 03:26:41,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:41,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924886906] [2022-07-12 03:26:41,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:26:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:26:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:26:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:26:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:41,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924886906] [2022-07-12 03:26:41,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924886906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:41,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:41,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:26:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688752917] [2022-07-12 03:26:41,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:41,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:26:41,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:26:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:26:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:26:41,596 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) [2022-07-12 03:26:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:41,699 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2022-07-12 03:26:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:26:41,701 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 [2022-07-12 03:26:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:41,708 INFO L225 Difference]: With dead ends: 147 [2022-07-12 03:26:41,708 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 03:26:41,711 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 [2022-07-12 03:26:41,715 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:41,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 99 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:26:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 03:26:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-07-12 03:26:41,749 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) [2022-07-12 03:26:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2022-07-12 03:26:41,753 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2022-07-12 03:26:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:41,754 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2022-07-12 03:26:41,754 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) [2022-07-12 03:26:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-07-12 03:26:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:26:41,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:41,756 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] [2022-07-12 03:26:41,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:26:41,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:41,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2022-07-12 03:26:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:41,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86368023] [2022-07-12 03:26:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:26:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:41,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:26:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:26:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:26:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:41,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86368023] [2022-07-12 03:26:41,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86368023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:41,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:41,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:26:41,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886184667] [2022-07-12 03:26:41,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:41,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:26:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:26:41,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:26:41,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:26:41,887 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) [2022-07-12 03:26:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:42,018 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-07-12 03:26:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:26:42,019 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 [2022-07-12 03:26:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:42,020 INFO L225 Difference]: With dead ends: 82 [2022-07-12 03:26:42,020 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 03:26:42,021 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 [2022-07-12 03:26:42,022 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:42,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 166 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:26:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 03:26:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2022-07-12 03:26:42,028 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) [2022-07-12 03:26:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-07-12 03:26:42,030 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2022-07-12 03:26:42,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:42,030 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-07-12 03:26:42,030 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) [2022-07-12 03:26:42,030 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-07-12 03:26:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:26:42,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:42,031 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] [2022-07-12 03:26:42,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:26:42,032 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2022-07-12 03:26:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:42,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552720112] [2022-07-12 03:26:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:26:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:26:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:26:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:26:42,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:42,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552720112] [2022-07-12 03:26:42,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552720112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:42,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:42,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:26:42,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72781646] [2022-07-12 03:26:42,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:42,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:26:42,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:26:42,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:26:42,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:26:42,190 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) [2022-07-12 03:26:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:42,572 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2022-07-12 03:26:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:26:42,572 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 [2022-07-12 03:26:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:42,574 INFO L225 Difference]: With dead ends: 206 [2022-07-12 03:26:42,574 INFO L226 Difference]: Without dead ends: 145 [2022-07-12 03:26:42,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:26:42,576 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 136 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:42,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 202 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 03:26:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-12 03:26:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2022-07-12 03:26:42,586 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) [2022-07-12 03:26:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2022-07-12 03:26:42,587 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2022-07-12 03:26:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:42,587 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2022-07-12 03:26:42,587 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) [2022-07-12 03:26:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2022-07-12 03:26:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 03:26:42,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:42,589 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] [2022-07-12 03:26:42,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:26:42,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:42,590 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2022-07-12 03:26:42,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:42,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411637030] [2022-07-12 03:26:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:42,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:26:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:26:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 03:26:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 03:26:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:26:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 03:26:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 03:26:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:26:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 03:26:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 03:26:42,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411637030] [2022-07-12 03:26:42,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411637030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:26:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620667741] [2022-07-12 03:26:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:42,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:26:42,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:26:42,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:26:42,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:26:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:42,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:26:42,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 03:26:42,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:42,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620667741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:42,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:26:42,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-12 03:26:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294899938] [2022-07-12 03:26:42,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:42,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:26:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:26:42,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:26:42,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:26:42,856 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) [2022-07-12 03:26:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:42,871 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2022-07-12 03:26:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:26:42,871 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 [2022-07-12 03:26:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:42,873 INFO L225 Difference]: With dead ends: 219 [2022-07-12 03:26:42,873 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 03:26:42,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:26:42,874 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:42,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 03:26:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-12 03:26:42,882 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) [2022-07-12 03:26:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2022-07-12 03:26:42,884 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2022-07-12 03:26:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:42,884 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2022-07-12 03:26:42,884 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) [2022-07-12 03:26:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2022-07-12 03:26:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 03:26:42,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:42,886 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] [2022-07-12 03:26:42,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:26:43,105 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2022-07-12 03:26:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:26:43,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953830163] [2022-07-12 03:26:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:26:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:26:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:26:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 03:26:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 03:26:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:26:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 03:26:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:43,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 03:26:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:43,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 03:26:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:26:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:26:44,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953830163] [2022-07-12 03:26:44,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953830163] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:26:44,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118228298] [2022-07-12 03:26:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:44,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:26:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:26:44,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:26:44,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:26:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:44,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 199 conjunts are in the unsatisfiable core [2022-07-12 03:26:44,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:44,557 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:26:44,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:26:44,750 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 03:26:44,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 33 [2022-07-12 03:26:44,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:44,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:46,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:46,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:46,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:46,089 INFO L356 Elim1Store]: treesize reduction 168, result has 22.9 percent of original size [2022-07-12 03:26:46,090 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:26:46,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 03:26:46,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:26:46,292 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) 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:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) 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:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) 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:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:248) 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:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-07-12 03:26:46,295 INFO L158 Benchmark]: Toolchain (without parser) took 5795.79ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 66.2MB in the beginning and 90.5MB in the end (delta: -24.3MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-07-12 03:26:46,295 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory was 75.5MB in the beginning and 75.5MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:26:46,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.35ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 67.9MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:26:46,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.19ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:26:46,296 INFO L158 Benchmark]: Boogie Preprocessor took 29.78ms. Allocated memory is still 102.8MB. Free memory was 65.8MB in the beginning and 63.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:26:46,296 INFO L158 Benchmark]: RCFGBuilder took 352.03ms. Allocated memory is still 102.8MB. Free memory was 63.7MB in the beginning and 46.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 03:26:46,296 INFO L158 Benchmark]: TraceAbstraction took 5032.07ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 46.1MB in the beginning and 90.5MB in the end (delta: -44.3MB). Peak memory consumption was 696.6kB. Max. memory is 16.1GB. [2022-07-12 03:26:46,297 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory was 75.5MB in the beginning and 75.5MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.35ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 67.9MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.19ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.78ms. Allocated memory is still 102.8MB. Free memory was 65.8MB in the beginning and 63.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.03ms. Allocated memory is still 102.8MB. Free memory was 63.7MB in the beginning and 46.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5032.07ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 46.1MB in the beginning and 90.5MB in the end (delta: -44.3MB). Peak memory consumption was 696.6kB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 03:26:46,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.2-?-6c24879 [2022-07-12 03:26:48,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:26:48,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:26:48,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:26:48,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:26:48,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:26:48,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:26:48,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:26:48,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:26:48,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:26:48,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:26:48,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:26:48,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:26:48,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:26:48,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:26:48,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:26:48,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:26:48,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:26:48,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:26:48,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:26:48,210 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:26:48,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:26:48,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:26:48,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:26:48,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:26:48,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:26:48,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:26:48,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:26:48,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:26:48,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:26:48,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:26:48,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:26:48,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:26:48,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:26:48,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:26:48,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:26:48,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:26:48,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:26:48,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:26:48,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:26:48,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:26:48,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:26:48,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:26:48,251 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:26:48,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:26:48,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:26:48,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:26:48,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:26:48,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:26:48,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:26:48,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:26:48,254 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:26:48,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:26:48,254 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:26:48,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:26:48,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:26:48,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:26:48,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:26:48,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:26:48,255 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:26:48,256 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:26:48,256 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:26:48,256 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:26:48,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:26:48,256 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:26:48,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:26:48,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:26:48,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:26:48,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:26:48,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:26:48,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:26:48,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:26:48,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:26:48,257 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:26:48,258 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:26:48,258 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:26:48,258 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:26:48,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:26:48,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:26:48,258 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2022-07-12 03:26:48,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:26:48,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:26:48,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:26:48,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:26:48,565 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:26:48,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex.i [2022-07-12 03:26:48,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c796353b1/fbd874d5c83a4e6c82bebeec88048ac0/FLAGa1be5e316 [2022-07-12 03:26:49,042 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:26:49,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i [2022-07-12 03:26:49,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c796353b1/fbd874d5c83a4e6c82bebeec88048ac0/FLAGa1be5e316 [2022-07-12 03:26:49,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c796353b1/fbd874d5c83a4e6c82bebeec88048ac0 [2022-07-12 03:26:49,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:26:49,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:26:49,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:49,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:26:49,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:26:49,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a990f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49, skipping insertion in model container [2022-07-12 03:26:49,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:26:49,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:26:49,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2022-07-12 03:26:49,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2022-07-12 03:26:49,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2022-07-12 03:26:49,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:49,506 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 03:26:49,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:26:49,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2022-07-12 03:26:49,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2022-07-12 03:26:49,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2022-07-12 03:26:49,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:49,551 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:26:49,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25842,25855] [2022-07-12 03:26:49,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[25967,25980] [2022-07-12 03:26:49,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i[26082,26095] [2022-07-12 03:26:49,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:49,609 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:26:49,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49 WrapperNode [2022-07-12 03:26:49,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:49,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:49,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:26:49,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:26:49,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,670 INFO L137 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 125 [2022-07-12 03:26:49,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:49,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:26:49,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:26:49,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:26:49,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:26:49,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:26:49,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:26:49,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:26:49,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (1/1) ... [2022-07-12 03:26:49,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:26:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:26:49,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:26:49,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:26:49,784 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-12 03:26:49,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-12 03:26:49,784 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 03:26:49,785 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 03:26:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:26:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-12 03:26:49,785 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-12 03:26:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:26:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:26:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-12 03:26:49,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-12 03:26:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:26:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:26:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:26:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:26:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-12 03:26:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-12 03:26:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:26:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:26:49,975 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:26:49,976 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:26:50,289 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:26:50,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:26:50,296 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:26:50,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:26:50 BoogieIcfgContainer [2022-07-12 03:26:50,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:26:50,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:26:50,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:26:50,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:26:50,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:26:49" (1/3) ... [2022-07-12 03:26:50,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d41b513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:26:50, skipping insertion in model container [2022-07-12 03:26:50,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:49" (2/3) ... [2022-07-12 03:26:50,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d41b513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:26:50, skipping insertion in model container [2022-07-12 03:26:50,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:26:50" (3/3) ... [2022-07-12 03:26:50,319 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex.i [2022-07-12 03:26:50,329 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:26:50,333 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-12 03:26:50,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:26:50,379 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2cd76633, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@261cf222 [2022-07-12 03:26:50,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 03:26:50,382 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) [2022-07-12 03:26:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:26:50,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:50,389 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] [2022-07-12 03:26:50,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:50,394 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2022-07-12 03:26:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:50,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378136775] [2022-07-12 03:26:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:50,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:50,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:50,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:50,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:26:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:50,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:26:50,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:26:50,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:50,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:50,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378136775] [2022-07-12 03:26:50,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378136775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:50,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:50,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:26:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298923384] [2022-07-12 03:26:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:50,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:26:50,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:50,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:26:50,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:26:50,638 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:26:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:50,663 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-07-12 03:26:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:26:50,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-07-12 03:26:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:50,671 INFO L225 Difference]: With dead ends: 130 [2022-07-12 03:26:50,671 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 03:26:50,675 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 [2022-07-12 03:26:50,677 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 [2022-07-12 03:26:50,679 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] [2022-07-12 03:26:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 03:26:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 03:26:50,705 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) [2022-07-12 03:26:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-12 03:26:50,712 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2022-07-12 03:26:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:50,713 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-12 03:26:50,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:26:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-12 03:26:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:26:50,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:50,716 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] [2022-07-12 03:26:50,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:50,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:26:50,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:50,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2022-07-12 03:26:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:50,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418776361] [2022-07-12 03:26:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:50,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:50,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:26:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:51,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 03:26:51,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:26:51,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:51,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:51,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418776361] [2022-07-12 03:26:51,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418776361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:51,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:51,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:26:51,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878931210] [2022-07-12 03:26:51,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:51,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:26:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:26:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:26:51,378 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) [2022-07-12 03:26:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:51,627 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-07-12 03:26:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:26:51,627 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 [2022-07-12 03:26:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:51,630 INFO L225 Difference]: With dead ends: 170 [2022-07-12 03:26:51,630 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 03:26:51,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:26:51,631 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:51,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 184 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:26:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 03:26:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2022-07-12 03:26:51,643 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) [2022-07-12 03:26:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2022-07-12 03:26:51,661 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2022-07-12 03:26:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:51,661 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2022-07-12 03:26:51,662 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) [2022-07-12 03:26:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-07-12 03:26:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:26:51,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:51,663 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] [2022-07-12 03:26:51,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:51,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:26:51,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2022-07-12 03:26:51,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:51,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988305257] [2022-07-12 03:26:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:51,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:51,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:51,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:51,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:26:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:51,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:26:51,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:26:51,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:51,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:51,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988305257] [2022-07-12 03:26:51,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988305257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:51,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:51,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:26:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289725763] [2022-07-12 03:26:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:51,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:26:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:51,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:26:51,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:26:51,953 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) [2022-07-12 03:26:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:51,967 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2022-07-12 03:26:51,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:26:51,968 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 [2022-07-12 03:26:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:51,969 INFO L225 Difference]: With dead ends: 108 [2022-07-12 03:26:51,969 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 03:26:51,970 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 [2022-07-12 03:26:51,970 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:51,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 03:26:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-07-12 03:26:51,979 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) [2022-07-12 03:26:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-07-12 03:26:51,980 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2022-07-12 03:26:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:51,980 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-07-12 03:26:51,980 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) [2022-07-12 03:26:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-07-12 03:26:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 03:26:51,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:51,982 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] [2022-07-12 03:26:52,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:52,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:26:52,190 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2022-07-12 03:26:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:52,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849403780] [2022-07-12 03:26:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:52,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:52,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:52,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:52,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:26:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:52,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 03:26:52,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:52,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:52,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 03:26:52,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:52,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:52,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849403780] [2022-07-12 03:26:52,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849403780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:52,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:52,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:26:52,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543535083] [2022-07-12 03:26:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:52,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:26:52,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:52,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:26:52,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:26:52,650 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 9 states, 8 states have (on average 4.75) 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) [2022-07-12 03:26:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:53,875 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2022-07-12 03:26:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 03:26:53,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) 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 [2022-07-12 03:26:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:53,879 INFO L225 Difference]: With dead ends: 268 [2022-07-12 03:26:53,880 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 03:26:53,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-07-12 03:26:53,881 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 241 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:53,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 312 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 03:26:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 03:26:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2022-07-12 03:26:53,896 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) [2022-07-12 03:26:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-07-12 03:26:53,904 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2022-07-12 03:26:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:53,905 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-07-12 03:26:53,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) 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) [2022-07-12 03:26:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-07-12 03:26:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 03:26:53,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:53,909 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] [2022-07-12 03:26:53,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:54,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:26:54,119 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2022-07-12 03:26:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:54,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214184241] [2022-07-12 03:26:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:54,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:54,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:54,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:26:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:54,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:26:54,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 03:26:54,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:26:54,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:26:54,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214184241] [2022-07-12 03:26:54,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214184241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:26:54,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:26:54,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:26:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513909254] [2022-07-12 03:26:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:26:54,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:26:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:26:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:26:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:26:54,272 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) [2022-07-12 03:26:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:26:54,286 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2022-07-12 03:26:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:26:54,286 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 [2022-07-12 03:26:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:26:54,287 INFO L225 Difference]: With dead ends: 196 [2022-07-12 03:26:54,287 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 03:26:54,288 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 [2022-07-12 03:26:54,288 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:26:54,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:26:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 03:26:54,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-07-12 03:26:54,296 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) [2022-07-12 03:26:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-07-12 03:26:54,297 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2022-07-12 03:26:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:26:54,302 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-07-12 03:26:54,303 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) [2022-07-12 03:26:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-07-12 03:26:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 03:26:54,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:26:54,304 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] [2022-07-12 03:26:54,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:26:54,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:26:54,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:26:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:26:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2022-07-12 03:26:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:26:54,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256677278] [2022-07-12 03:26:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:26:54,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:26:54,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:26:54,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:26:54,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:26:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:26:54,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-12 03:26:54,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:26:54,829 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:26:54,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-07-12 03:26:54,959 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 03:26:54,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:26:55,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:55,555 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-12 03:26:55,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 229 [2022-07-12 03:26:55,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:55,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:55,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:55,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:55,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2022-07-12 03:26:55,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:55,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:55,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:26:55,953 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 03:26:55,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 116 [2022-07-12 03:26:55,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:55,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:56,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:26:56,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2022-07-12 03:26:56,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:26:56,255 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.offset (_ BitVec 32))) (= (store (store (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_87) |c___ldv_list_add_#in~new.base| (store (store (select (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base|) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |c___ldv_list_add_#in~new.base|)) |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)) |c___ldv_list_add_#in~prev.base|)) |c___ldv_list_add_#in~prev.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_91) |c___ldv_list_add_#in~new.base| v_ArrVal_77) |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|)) (= (_ bv3 32) |c_~#mutexes~0.base|) (let ((.cse2 (= |c___ldv_list_add_#in~new.offset| (select (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|))) (.cse5 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|))) (let ((.cse1 (and .cse2 (not .cse5))) (.cse0 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|))) (or (and .cse0 (or .cse1 (and .cse2 (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_11) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_12) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_11) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_12))) (and (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_12 |c___ldv_list_add_#in~prev.offset|)) (= v_DerPreprocessor_11 (select .cse3 |c___ldv_list_add_#in~new.base|)) (= v_DerPreprocessor_10 (select .cse3 |c___ldv_list_add_#in~next.base|))))) (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 ((.cse4 (store (store (store (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) |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 .cse4 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_1) (= (select .cse4 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_2) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_3 |c___ldv_list_add_#in~prev.offset|)))))))) (and (or .cse1 (and .cse2 .cse5 (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 ((.cse10 (select (store (store (store (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) |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) |c___ldv_list_add_#in~new.base|))) (and (exists ((v_prenex_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_18) |c___ldv_list_add_#in~new.base| v_prenex_19) |c___ldv_list_add_#in~prev.base| v_prenex_20) |c___ldv_list_add_#in~next.base| v_prenex_18) |c___ldv_list_add_#in~new.base| v_prenex_19) |c___ldv_list_add_#in~prev.base| v_prenex_20))) (let ((.cse6 (select .cse9 |c___ldv_list_add_#in~new.base|)) (.cse7 (store (store (store (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) |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)) (.cse8 (select .cse9 |c___ldv_list_add_#in~next.base|))) (and (= .cse6 (select .cse7 |c___ldv_list_add_#in~new.base|)) (= .cse6 v_prenex_19) (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|) .cse8) (= (select .cse7 |c___ldv_list_add_#in~next.base|) .cse8))))) (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) .cse10) (= v_DerPreprocessor_8 .cse10)))) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_9 |c___ldv_list_add_#in~prev.offset|)))) (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)))) (and (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 ((.cse12 (store (store (store (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) |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))) (let ((.cse11 (select .cse12 |c___ldv_list_add_#in~next.base|))) (and (= .cse11 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)) (= .cse11 (select (store (store (store (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) |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) |c___ldv_list_add_#in~next.base|)) (= v_DerPreprocessor_5 (select .cse12 |c___ldv_list_add_#in~new.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_6 |c___ldv_list_add_#in~prev.offset|)))))) (= v_DerPreprocessor_8 (select (store (store (store (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) |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) |c___ldv_list_add_#in~new.base|))))))))) (not .cse0))))) (= |c_~#mutexes~0.offset| (_ bv0 32))) is different from true [2022-07-12 03:26:56,489 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.offset (_ BitVec 32))) (= (store (store (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_87) |c___ldv_list_add_#in~new.base| (store (store (select (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base|) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |c___ldv_list_add_#in~new.base|)) |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)) |c___ldv_list_add_#in~prev.base|)) |c___ldv_list_add_#in~prev.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_91) |c___ldv_list_add_#in~new.base| v_ArrVal_77) |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|)) (let ((.cse2 (= |c___ldv_list_add_#in~new.offset| (select (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|)))) (let ((.cse0 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|)) (.cse1 (and .cse2 (not (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|))))) (or (and (not .cse0) (or .cse1 (and .cse2 (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 ((.cse7 (select (store (store (store (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) |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) |c___ldv_list_add_#in~new.base|))) (and (exists ((v_prenex_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_18) |c___ldv_list_add_#in~new.base| v_prenex_19) |c___ldv_list_add_#in~prev.base| v_prenex_20) |c___ldv_list_add_#in~next.base| v_prenex_18) |c___ldv_list_add_#in~new.base| v_prenex_19) |c___ldv_list_add_#in~prev.base| v_prenex_20))) (let ((.cse3 (select .cse6 |c___ldv_list_add_#in~new.base|)) (.cse4 (store (store (store (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) |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)) (.cse5 (select .cse6 |c___ldv_list_add_#in~next.base|))) (and (= .cse3 (select .cse4 |c___ldv_list_add_#in~new.base|)) (= .cse3 v_prenex_19) (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|) .cse5) (= (select .cse4 |c___ldv_list_add_#in~next.base|) .cse5))))) (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) .cse7) (= v_DerPreprocessor_8 .cse7)))) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_9 |c___ldv_list_add_#in~prev.offset|)))) (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)))) (and (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 ((.cse9 (store (store (store (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) |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))) (let ((.cse8 (select .cse9 |c___ldv_list_add_#in~next.base|))) (and (= .cse8 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)) (= .cse8 (select (store (store (store (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) |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) |c___ldv_list_add_#in~next.base|)) (= v_DerPreprocessor_5 (select .cse9 |c___ldv_list_add_#in~new.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_6 |c___ldv_list_add_#in~prev.offset|)))))) (= v_DerPreprocessor_8 (select (store (store (store (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) |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) |c___ldv_list_add_#in~new.base|)))))))))) (and .cse0 (or .cse1 (and .cse2 (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_11) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_12) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_11) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_12))) (and (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_12 |c___ldv_list_add_#in~prev.offset|)) (= v_DerPreprocessor_11 (select .cse10 |c___ldv_list_add_#in~new.base|)) (= v_DerPreprocessor_10 (select .cse10 |c___ldv_list_add_#in~next.base|))))) (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 ((.cse11 (store (store (store (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) |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 .cse11 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_1) (= (select .cse11 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_2) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_3 |c___ldv_list_add_#in~prev.offset|))))))))))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#mutexes~0.offset| (_ bv0 32))) is different from true [2022-07-12 03:27:44,408 WARN L233 SmtUtils]: Spent 26.76s on a formula simplification that was a NOOP. DAG size: 151 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:27:50,578 INFO L173 IndexEqualityManager]: detected equality via solver