./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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_double_unlock.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 d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:42:56,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:42:56,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:42:56,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:42:56,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:42:56,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:42:56,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:42:56,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:42:56,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:42:56,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:42:56,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:42:56,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:42:56,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:42:56,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:42:56,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:42:56,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:42:56,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:42:56,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:42:56,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:42:56,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:42:56,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:42:56,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:42:56,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:42:56,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:42:56,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:42:56,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:42:56,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:42:56,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:42:56,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:42:56,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:42:56,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:42:56,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:42:56,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:42:56,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:42:56,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:42:56,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:42:56,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:42:56,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:42:56,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:42:56,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:42:56,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:42:56,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:42:56,721 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:42:56,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:42:56,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:42:56,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:42:56,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:42:56,723 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:42:56,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:42:56,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:42:56,724 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:42:56,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:42:56,724 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:42:56,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:42:56,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:42:56,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:42:56,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:42:56,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:42:56,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:42:56,725 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:42:56,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:42:56,725 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:42:56,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:42:56,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:42:56,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:42:56,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:42:56,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:42:56,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:42:56,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:42:56,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:42:56,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:42:56,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:42:56,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:42:56,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:42:56,727 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:42:56,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:42:56,728 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:42:56,728 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2023-02-15 10:42:56,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:42:56,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:42:56,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:42:56,951 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:42:56,952 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:42:56,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-02-15 10:42:57,902 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:42:58,150 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:42:58,150 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-02-15 10:42:58,162 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17731798c/20003ba6e31345308b49426d2d743931/FLAG2a6a69b4a [2023-02-15 10:42:58,172 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17731798c/20003ba6e31345308b49426d2d743931 [2023-02-15 10:42:58,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:42:58,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:42:58,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:42:58,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:42:58,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:42:58,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f9947d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58, skipping insertion in model container [2023-02-15 10:42:58,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:42:58,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:42:58,413 WARN L237 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_double_unlock.i[25842,25855] [2023-02-15 10:42:58,416 WARN L237 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_double_unlock.i[25967,25980] [2023-02-15 10:42:58,417 WARN L237 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_double_unlock.i[26082,26095] [2023-02-15 10:42:58,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:42:58,425 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:42:58,453 WARN L237 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_double_unlock.i[25842,25855] [2023-02-15 10:42:58,454 WARN L237 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_double_unlock.i[25967,25980] [2023-02-15 10:42:58,454 WARN L237 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_double_unlock.i[26082,26095] [2023-02-15 10:42:58,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:42:58,473 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:42:58,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58 WrapperNode [2023-02-15 10:42:58,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:42:58,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:42:58,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:42:58,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:42:58,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,504 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 129 [2023-02-15 10:42:58,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:42:58,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:42:58,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:42:58,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:42:58,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:42:58,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:42:58,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:42:58,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:42:58,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (1/1) ... [2023-02-15 10:42:58,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:42:58,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:42:58,570 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) [2023-02-15 10:42:58,575 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 [2023-02-15 10:42:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-15 10:42:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-15 10:42:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-02-15 10:42:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-02-15 10:42:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:42:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-02-15 10:42:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-02-15 10:42:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:42:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:42:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-02-15 10:42:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-02-15 10:42:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:42:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:42:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 10:42:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:42:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-02-15 10:42:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-02-15 10:42:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:42:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:42:58,695 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:42:58,697 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:42:58,950 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:42:58,955 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:42:58,955 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 10:42:58,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:42:58 BoogieIcfgContainer [2023-02-15 10:42:58,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:42:58,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:42:58,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:42:58,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:42:58,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:42:58" (1/3) ... [2023-02-15 10:42:58,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c47e527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:42:58, skipping insertion in model container [2023-02-15 10:42:58,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:58" (2/3) ... [2023-02-15 10:42:58,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c47e527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:42:58, skipping insertion in model container [2023-02-15 10:42:58,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:42:58" (3/3) ... [2023-02-15 10:42:58,962 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2023-02-15 10:42:58,974 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:42:58,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-02-15 10:42:59,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:42:59,022 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e36210d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:42:59,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-02-15 10:42:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:42:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 10:42:59,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:59,030 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:59,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2023-02-15 10:42:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:59,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574756811] [2023-02-15 10:42:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:59,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:42:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:59,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:42:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 10:42:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:42:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:42:59,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574756811] [2023-02-15 10:42:59,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574756811] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:42:59,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:42:59,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:42:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164976653] [2023-02-15 10:42:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:42:59,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:42:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:42:59,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:42:59,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:42:59,274 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 10:42:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:42:59,411 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2023-02-15 10:42:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:42:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-02-15 10:42:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:42:59,419 INFO L225 Difference]: With dead ends: 147 [2023-02-15 10:42:59,419 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 10:42:59,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:42:59,446 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:42:59,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:42:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 10:42:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2023-02-15 10:42:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:42:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-02-15 10:42:59,501 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2023-02-15 10:42:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:42:59,502 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-02-15 10:42:59,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 10:42:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-02-15 10:42:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 10:42:59,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:59,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:59,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:42:59,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:59,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:59,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2023-02-15 10:42:59,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:59,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94877790] [2023-02-15 10:42:59,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:59,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:42:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:59,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:42:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 10:42:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:42:59,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:42:59,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94877790] [2023-02-15 10:42:59,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94877790] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:42:59,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:42:59,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:42:59,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297897592] [2023-02-15 10:42:59,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:42:59,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:42:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:42:59,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:42:59,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:42:59,733 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 10:42:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:42:59,890 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-02-15 10:42:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:42:59,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-02-15 10:42:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:42:59,892 INFO L225 Difference]: With dead ends: 82 [2023-02-15 10:42:59,892 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 10:42:59,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:42:59,893 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:42:59,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 141 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:42:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 10:42:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2023-02-15 10:42:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2023-02-15 10:42:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-02-15 10:42:59,901 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2023-02-15 10:42:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:42:59,901 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-02-15 10:42:59,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 10:42:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-02-15 10:42:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 10:42:59,902 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:59,903 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:59,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:42:59,903 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2023-02-15 10:42:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:59,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241137242] [2023-02-15 10:42:59,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:43:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 10:43:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:43:00,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:43:00,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241137242] [2023-02-15 10:43:00,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241137242] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:43:00,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:43:00,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 10:43:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732460946] [2023-02-15 10:43:00,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:43:00,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:43:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:43:00,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:43:00,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:43:00,135 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 10:43:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:43:00,483 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2023-02-15 10:43:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:43:00,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-02-15 10:43:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:43:00,489 INFO L225 Difference]: With dead ends: 206 [2023-02-15 10:43:00,489 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 10:43:00,493 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 [2023-02-15 10:43:00,495 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 142 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:43:00,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 168 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:43:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 10:43:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2023-02-15 10:43:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) [2023-02-15 10:43:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-02-15 10:43:00,520 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2023-02-15 10:43:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:43:00,521 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-02-15 10:43:00,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 10:43:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-02-15 10:43:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 10:43:00,524 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:00,525 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:00,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:43:00,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:00,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2023-02-15 10:43:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:43:00,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228927707] [2023-02-15 10:43:00,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:00,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:43:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:43:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 10:43:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 10:43:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 10:43:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 10:43:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-15 10:43:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-02-15 10:43:00,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:43:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228927707] [2023-02-15 10:43:00,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228927707] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:43:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619095673] [2023-02-15 10:43:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:00,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:43:00,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:43:00,679 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) [2023-02-15 10:43:00,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:43:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:00,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:43:00,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-15 10:43:00,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:43:00,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619095673] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:43:00,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:43:00,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-15 10:43:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351780412] [2023-02-15 10:43:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:43:00,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:43:00,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:43:00,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:43:00,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:43:00,898 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 10:43:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:43:00,928 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2023-02-15 10:43:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:43:00,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2023-02-15 10:43:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:43:00,930 INFO L225 Difference]: With dead ends: 219 [2023-02-15 10:43:00,930 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 10:43:00,930 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 [2023-02-15 10:43:00,931 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 [2023-02-15 10:43:00,931 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] [2023-02-15 10:43:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 10:43:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-02-15 10:43:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 96 states have internal predecessors, (107), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (30), 20 states have call predecessors, (30), 18 states have call successors, (30) [2023-02-15 10:43:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2023-02-15 10:43:00,940 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2023-02-15 10:43:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:43:00,941 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2023-02-15 10:43:00,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 10:43:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2023-02-15 10:43:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 10:43:00,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:00,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:00,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 10:43:01,145 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 [2023-02-15 10:43:01,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:01,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2023-02-15 10:43:01,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:43:01,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947901875] [2023-02-15 10:43:01,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:43:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:02,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:43:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:03,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:03,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 10:43:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 10:43:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:03,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:04,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:43:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:43:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-15 10:43:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 10:43:04,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:43:04,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947901875] [2023-02-15 10:43:04,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947901875] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:43:04,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344370019] [2023-02-15 10:43:04,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:04,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:43:04,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:43:04,472 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) [2023-02-15 10:43:04,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:43:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:04,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 198 conjunts are in the unsatisfiable core [2023-02-15 10:43:04,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:04,891 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:43:04,892 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:43:05,080 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 10:43:05,081 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:43:05,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:05,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:06,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:06,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:06,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:06,480 INFO L321 Elim1Store]: treesize reduction 158, result has 24.0 percent of original size [2023-02-15 10:43:06,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 190 treesize of output 155 [2023-02-15 10:43:06,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:06,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:06,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-02-15 10:43:06,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:06,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:06,517 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 80 [2023-02-15 10:43:06,532 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-15 10:43:06,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-02-15 10:43:06,550 INFO L321 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2023-02-15 10:43:06,551 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 71 [2023-02-15 10:43:06,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:43:06,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 74 [2023-02-15 10:43:06,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:06,576 INFO L321 Elim1Store]: treesize reduction 8, result has 74.2 percent of original size [2023-02-15 10:43:06,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2023-02-15 10:43:06,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-02-15 10:43:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 10:43:07,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:43:08,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344370019] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:43:08,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:43:08,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29] total 62 [2023-02-15 10:43:08,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861043943] [2023-02-15 10:43:08,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:43:08,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-02-15 10:43:08,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:43:08,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-02-15 10:43:08,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4437, Unknown=7, NotChecked=0, Total=4692 [2023-02-15 10:43:08,786 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 62 states, 50 states have (on average 1.66) internal successors, (83), 43 states have internal predecessors, (83), 17 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-02-15 10:43:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:43:14,285 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2023-02-15 10:43:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 10:43:14,285 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 50 states have (on average 1.66) internal successors, (83), 43 states have internal predecessors, (83), 17 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 63 [2023-02-15 10:43:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:43:14,289 INFO L225 Difference]: With dead ends: 266 [2023-02-15 10:43:14,289 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 10:43:14,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2071 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=844, Invalid=10069, Unknown=7, NotChecked=0, Total=10920 [2023-02-15 10:43:14,303 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 987 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 4660 mSolverCounterSat, 343 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 5016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 4660 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:43:14,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1621 Invalid, 5016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 4660 Invalid, 13 Unknown, 0 Unchecked, 3.1s Time] [2023-02-15 10:43:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 10:43:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2023-02-15 10:43:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.201834862385321) internal successors, (131), 115 states have internal predecessors, (131), 21 states have call successors, (21), 11 states have call predecessors, (21), 17 states have return successors, (36), 23 states have call predecessors, (36), 21 states have call successors, (36) [2023-02-15 10:43:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2023-02-15 10:43:14,328 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 63 [2023-02-15 10:43:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:43:14,328 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2023-02-15 10:43:14,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 50 states have (on average 1.66) internal successors, (83), 43 states have internal predecessors, (83), 17 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-02-15 10:43:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2023-02-15 10:43:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 10:43:14,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:14,334 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:14,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:43:14,539 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 [2023-02-15 10:43:14,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2102607608, now seen corresponding path program 1 times [2023-02-15 10:43:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:43:14,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137130615] [2023-02-15 10:43:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:14,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:43:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:43:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 10:43:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 10:43:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 10:43:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 10:43:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-15 10:43:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 10:43:14,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:43:14,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137130615] [2023-02-15 10:43:14,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137130615] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:43:14,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621241495] [2023-02-15 10:43:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:14,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:43:14,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:43:14,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:43:14,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:43:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:14,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 10:43:14,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:14,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:14,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:15,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:15,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-15 10:43:15,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:43:15,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621241495] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:43:15,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:43:15,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2023-02-15 10:43:15,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135131142] [2023-02-15 10:43:15,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:43:15,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:43:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:43:15,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:43:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-15 10:43:15,263 INFO L87 Difference]: Start difference. First operand 150 states and 188 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 10:43:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:43:15,717 INFO L93 Difference]: Finished difference Result 312 states and 382 transitions. [2023-02-15 10:43:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 10:43:15,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 72 [2023-02-15 10:43:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:43:15,719 INFO L225 Difference]: With dead ends: 312 [2023-02-15 10:43:15,719 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 10:43:15,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-02-15 10:43:15,720 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 204 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:43:15,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 231 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:43:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 10:43:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2023-02-15 10:43:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 104 states have internal predecessors, (116), 17 states have call successors, (17), 11 states have call predecessors, (17), 15 states have return successors, (26), 18 states have call predecessors, (26), 17 states have call successors, (26) [2023-02-15 10:43:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2023-02-15 10:43:15,741 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 72 [2023-02-15 10:43:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:43:15,741 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2023-02-15 10:43:15,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 10:43:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2023-02-15 10:43:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 10:43:15,743 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:15,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:15,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:43:15,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:43:15,954 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1485354123, now seen corresponding path program 1 times [2023-02-15 10:43:15,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:43:15,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418773077] [2023-02-15 10:43:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:15,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:43:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:43:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:17,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 10:43:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 10:43:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 10:43:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:18,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:43:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:43:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:18,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-15 10:43:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 10:43:18,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:43:18,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418773077] [2023-02-15 10:43:18,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418773077] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:43:18,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613957349] [2023-02-15 10:43:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:18,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:43:18,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:43:18,584 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:43:18,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:43:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:18,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 177 conjunts are in the unsatisfiable core [2023-02-15 10:43:18,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:18,879 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:43:18,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 10:43:18,998 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:43:18,998 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:43:19,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:19,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:19,478 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2023-02-15 10:43:19,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 410 treesize of output 274 [2023-02-15 10:43:19,520 INFO L321 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2023-02-15 10:43:19,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 266 treesize of output 205 [2023-02-15 10:43:19,583 INFO L321 Elim1Store]: treesize reduction 122, result has 22.3 percent of original size [2023-02-15 10:43:19,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 179 treesize of output 207 [2023-02-15 10:43:19,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:43:19,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:43:19,738 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:19,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:43:19,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2023-02-15 10:43:19,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:43:19,820 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:19,855 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:19,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:43:19,917 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:19,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 102 [2023-02-15 10:43:20,020 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-02-15 10:43:20,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 3 [2023-02-15 10:43:20,029 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:20,062 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:20,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-02-15 10:43:20,079 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-15 10:43:20,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:43:20,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:43:20,280 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) 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:122) 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:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) 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:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-02-15 10:43:20,282 INFO L158 Benchmark]: Toolchain (without parser) took 22105.49ms. Allocated memory was 155.2MB in the beginning and 337.6MB in the end (delta: 182.5MB). Free memory was 116.8MB in the beginning and 156.1MB in the end (delta: -39.2MB). Peak memory consumption was 142.8MB. Max. memory is 16.1GB. [2023-02-15 10:43:20,283 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 91.7MB in the beginning and 91.6MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:43:20,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.89ms. Allocated memory is still 155.2MB. Free memory was 116.8MB in the beginning and 113.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 10:43:20,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.43ms. Allocated memory is still 155.2MB. Free memory was 113.8MB in the beginning and 111.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:43:20,283 INFO L158 Benchmark]: Boogie Preprocessor took 37.70ms. Allocated memory is still 155.2MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:43:20,283 INFO L158 Benchmark]: RCFGBuilder took 412.36ms. Allocated memory is still 155.2MB. Free memory was 109.6MB in the beginning and 89.3MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 10:43:20,284 INFO L158 Benchmark]: TraceAbstraction took 21323.95ms. Allocated memory was 155.2MB in the beginning and 337.6MB in the end (delta: 182.5MB). Free memory was 88.6MB in the beginning and 156.1MB in the end (delta: -67.4MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2023-02-15 10:43:20,286 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.13ms. Allocated memory is still 121.6MB. Free memory was 91.7MB in the beginning and 91.6MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.89ms. Allocated memory is still 155.2MB. Free memory was 116.8MB in the beginning and 113.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.43ms. Allocated memory is still 155.2MB. Free memory was 113.8MB in the beginning and 111.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.70ms. Allocated memory is still 155.2MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.36ms. Allocated memory is still 155.2MB. Free memory was 109.6MB in the beginning and 89.3MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21323.95ms. Allocated memory was 155.2MB in the beginning and 337.6MB in the end (delta: 182.5MB). Free memory was 88.6MB in the beginning and 156.1MB in the end (delta: -67.4MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-15 10:43:20,299 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_double_unlock.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 d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:43:22,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:43:22,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:43:22,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:43:22,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:43:22,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:43:22,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:43:22,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:43:22,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:43:22,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:43:22,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:43:22,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:43:22,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:43:22,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:43:22,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:43:22,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:43:22,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:43:22,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:43:22,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:43:22,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:43:22,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:43:22,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:43:22,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:43:22,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:43:22,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:43:22,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:43:22,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:43:22,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:43:22,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:43:22,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:43:22,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:43:22,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:43:22,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:43:22,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:43:22,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:43:22,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:43:22,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:43:22,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:43:22,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:43:22,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:43:22,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:43:22,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-15 10:43:22,245 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:43:22,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:43:22,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:43:22,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:43:22,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:43:22,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:43:22,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:43:22,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:43:22,248 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:43:22,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:43:22,248 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:43:22,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:43:22,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:43:22,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:43:22,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:43:22,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:43:22,249 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 10:43:22,249 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 10:43:22,250 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 10:43:22,250 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:43:22,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:43:22,250 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:43:22,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:43:22,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:43:22,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:43:22,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:43:22,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:43:22,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:43:22,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:43:22,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:43:22,251 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 10:43:22,252 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 10:43:22,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:43:22,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:43:22,252 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:43:22,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:43:22,252 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 10:43:22,253 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:43:22,253 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2023-02-15 10:43:22,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:43:22,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:43:22,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:43:22,483 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:43:22,484 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:43:22,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-02-15 10:43:23,517 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:43:23,730 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:43:23,731 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-02-15 10:43:23,759 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e63bc52/9d50692e0ece4abf9eab7d237f0e97b2/FLAG66fb27ac4 [2023-02-15 10:43:23,772 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e63bc52/9d50692e0ece4abf9eab7d237f0e97b2 [2023-02-15 10:43:23,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:43:23,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:43:23,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:43:23,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:43:23,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:43:23,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:43:23" (1/1) ... [2023-02-15 10:43:23,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c20af43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:23, skipping insertion in model container [2023-02-15 10:43:23,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:43:23" (1/1) ... [2023-02-15 10:43:23,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:43:23,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:43:24,045 WARN L237 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_double_unlock.i[25842,25855] [2023-02-15 10:43:24,051 WARN L237 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_double_unlock.i[25967,25980] [2023-02-15 10:43:24,054 WARN L237 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_double_unlock.i[26082,26095] [2023-02-15 10:43:24,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:43:24,070 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 10:43:24,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:43:24,132 WARN L237 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_double_unlock.i[25842,25855] [2023-02-15 10:43:24,135 WARN L237 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_double_unlock.i[25967,25980] [2023-02-15 10:43:24,136 WARN L237 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_double_unlock.i[26082,26095] [2023-02-15 10:43:24,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:43:24,142 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:43:24,184 WARN L237 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_double_unlock.i[25842,25855] [2023-02-15 10:43:24,185 WARN L237 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_double_unlock.i[25967,25980] [2023-02-15 10:43:24,186 WARN L237 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_double_unlock.i[26082,26095] [2023-02-15 10:43:24,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:43:24,227 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:43:24,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24 WrapperNode [2023-02-15 10:43:24,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:43:24,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:43:24,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:43:24,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:43:24,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,285 INFO L138 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 125 [2023-02-15 10:43:24,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:43:24,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:43:24,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:43:24,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:43:24,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,332 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:43:24,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:43:24,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:43:24,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:43:24,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (1/1) ... [2023-02-15 10:43:24,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:43:24,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:43:24,366 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) [2023-02-15 10:43:24,384 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 [2023-02-15 10:43:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-15 10:43:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-15 10:43:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-02-15 10:43:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-02-15 10:43:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:43:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-02-15 10:43:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-02-15 10:43:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:43:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:43:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-02-15 10:43:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-02-15 10:43:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:43:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:43:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 10:43:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 10:43:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-02-15 10:43:24,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-02-15 10:43:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:43:24,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:43:24,547 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:43:24,548 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:43:24,776 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:43:24,785 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:43:24,785 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 10:43:24,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:43:24 BoogieIcfgContainer [2023-02-15 10:43:24,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:43:24,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:43:24,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:43:24,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:43:24,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:43:23" (1/3) ... [2023-02-15 10:43:24,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173b2b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:43:24, skipping insertion in model container [2023-02-15 10:43:24,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:43:24" (2/3) ... [2023-02-15 10:43:24,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173b2b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:43:24, skipping insertion in model container [2023-02-15 10:43:24,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:43:24" (3/3) ... [2023-02-15 10:43:24,793 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2023-02-15 10:43:24,823 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:43:24,823 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-02-15 10:43:24,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:43:24,869 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a419c12, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:43:24,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-02-15 10:43:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:43:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:43:24,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:24,879 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:24,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:24,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:24,882 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2023-02-15 10:43:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:43:24,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345285228] [2023-02-15 10:43:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:24,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:43:24,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:43:24,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 10:43:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:25,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 10:43:25,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:43:25,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:43:25,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:43:25,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345285228] [2023-02-15 10:43:25,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345285228] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:43:25,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:43:25,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:43:25,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41805486] [2023-02-15 10:43:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:43:25,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:43:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:43:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:43:25,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:43:25,109 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) [2023-02-15 10:43:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:43:25,139 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2023-02-15 10:43:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:43:25,141 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 [2023-02-15 10:43:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:43:25,146 INFO L225 Difference]: With dead ends: 130 [2023-02-15 10:43:25,146 INFO L226 Difference]: Without dead ends: 62 [2023-02-15 10:43:25,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:43:25,152 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:43:25,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:43:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-15 10:43:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-02-15 10:43:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:43:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-02-15 10:43:25,189 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2023-02-15 10:43:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:43:25,189 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-02-15 10:43:25,189 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) [2023-02-15 10:43:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-02-15 10:43:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:43:25,191 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:25,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:25,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 10:43:25,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:25,399 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:25,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:25,400 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2023-02-15 10:43:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:43:25,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135667757] [2023-02-15 10:43:25,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:25,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:25,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:43:25,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:43:25,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 10:43:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:25,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 10:43:25,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:43:25,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:43:25,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:43:25,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135667757] [2023-02-15 10:43:25,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135667757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:43:25,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:43:25,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:43:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77619226] [2023-02-15 10:43:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:43:25,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:43:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:43:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:43:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:43:25,736 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 10:43:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:43:26,081 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2023-02-15 10:43:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:43:26,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-15 10:43:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:43:26,083 INFO L225 Difference]: With dead ends: 170 [2023-02-15 10:43:26,083 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 10:43:26,084 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 [2023-02-15 10:43:26,085 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 59 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:43:26,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 184 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:43:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 10:43:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2023-02-15 10:43:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (23), 17 states have call predecessors, (23), 18 states have call successors, (23) [2023-02-15 10:43:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2023-02-15 10:43:26,110 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2023-02-15 10:43:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:43:26,110 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2023-02-15 10:43:26,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 10:43:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2023-02-15 10:43:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:43:26,111 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:26,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:26,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:43:26,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:26,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:26,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:26,320 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2023-02-15 10:43:26,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:43:26,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040482018] [2023-02-15 10:43:26,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:26,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:26,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:43:26,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:43:26,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 10:43:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:26,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:43:26,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:43:26,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:43:26,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:43:26,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040482018] [2023-02-15 10:43:26,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040482018] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:43:26,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:43:26,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:43:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139005105] [2023-02-15 10:43:26,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:43:26,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:43:26,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:43:26,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:43:26,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:43:26,423 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 10:43:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:43:26,456 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2023-02-15 10:43:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:43:26,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-15 10:43:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:43:26,477 INFO L225 Difference]: With dead ends: 108 [2023-02-15 10:43:26,477 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 10:43:26,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:43:26,478 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 [2023-02-15 10:43:26,479 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] [2023-02-15 10:43:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 10:43:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2023-02-15 10:43:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2023-02-15 10:43:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2023-02-15 10:43:26,488 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2023-02-15 10:43:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:43:26,489 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2023-02-15 10:43:26,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 10:43:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2023-02-15 10:43:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 10:43:26,490 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:26,490 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:26,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:43:26,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:26,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:26,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2023-02-15 10:43:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:43:26,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309415438] [2023-02-15 10:43:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:26,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:43:26,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:43:26,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 10:43:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:26,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 10:43:26,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:26,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:26,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 10:43:27,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:43:27,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:43:27,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309415438] [2023-02-15 10:43:27,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309415438] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:43:27,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:43:27,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 10:43:27,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211677388] [2023-02-15 10:43:27,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:43:27,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 10:43:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:43:27,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 10:43:27,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:43:27,084 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 10:43:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:43:28,502 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2023-02-15 10:43:28,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 10:43:28,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 67 [2023-02-15 10:43:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:43:28,514 INFO L225 Difference]: With dead ends: 268 [2023-02-15 10:43:28,514 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 10:43:28,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-02-15 10:43:28,520 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 167 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:43:28,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 309 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 10:43:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 10:43:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2023-02-15 10:43:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 19 states have call successors, (19), 10 states have call predecessors, (19), 14 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2023-02-15 10:43:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2023-02-15 10:43:28,543 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2023-02-15 10:43:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:43:28,544 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2023-02-15 10:43:28,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 10:43:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2023-02-15 10:43:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 10:43:28,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:28,552 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:28,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:43:28,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:28,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:28,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2023-02-15 10:43:28,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:43:28,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366779041] [2023-02-15 10:43:28,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:28,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:28,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:43:28,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:43:28,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 10:43:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:28,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:43:28,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-15 10:43:28,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:43:28,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:43:28,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366779041] [2023-02-15 10:43:28,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366779041] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:43:28,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:43:28,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:43:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396772402] [2023-02-15 10:43:28,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:43:28,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:43:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:43:28,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:43:28,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:43:28,872 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 10:43:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:43:28,904 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2023-02-15 10:43:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:43:28,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2023-02-15 10:43:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:43:28,905 INFO L225 Difference]: With dead ends: 196 [2023-02-15 10:43:28,905 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 10:43:28,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:43:28,906 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 [2023-02-15 10:43:28,907 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] [2023-02-15 10:43:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 10:43:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-02-15 10:43:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2023-02-15 10:43:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2023-02-15 10:43:28,914 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2023-02-15 10:43:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:43:28,915 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2023-02-15 10:43:28,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 10:43:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2023-02-15 10:43:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 10:43:28,916 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:43:28,916 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:43:28,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-15 10:43:29,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:29,126 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:43:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:43:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2023-02-15 10:43:29,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:43:29,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365483315] [2023-02-15 10:43:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:43:29,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:43:29,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:43:29,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:43:29,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 10:43:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:43:29,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-15 10:43:29,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:43:29,413 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 10:43:29,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 10:43:29,566 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-02-15 10:43:29,566 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-15 10:43:29,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:43:30,307 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-02-15 10:43:30,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2023-02-15 10:43:30,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:43:30,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:43:30,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:43:30,754 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:31,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:31,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:43:31,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:43:31,380 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:43:31,382 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 17 [2023-02-15 10:43:31,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:43:31,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:43:31,445 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:31,452 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:43:31,458 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:43:31,477 INFO L321 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2023-02-15 10:43:31,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 328 treesize of output 269 [2023-02-15 10:43:31,542 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:31,546 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:43:31,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:43:31,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:43:34,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2023-02-15 10:43:36,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2023-02-15 10:43:38,888 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse27 (store (select |c_old(#memory_$Pointer$.base)| |c_~#mutexes~0.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|))) (let ((.cse25 (select .cse27 |c_~#mutexes~0.offset|))) (let ((.cse24 (store |c_old(#memory_$Pointer$.base)| |c_~#mutexes~0.base| .cse27)) (.cse26 (= .cse25 |c_~#mutexes~0.base|)) (.cse7 (= (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)))) (or (and (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse4 (select (select .cse3 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse2 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse4 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) .cse4 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9))) (let ((.cse5 (store (store (store (store (store (store .cse2 .cse4 v_DerPreprocessor_4) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_5) |c_~#mutexes~0.base| v_DerPreprocessor_6) .cse4 v_DerPreprocessor_4) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_5) |c_~#mutexes~0.base| v_DerPreprocessor_6))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|)) (.cse6 (select .cse5 .cse4)) (.cse0 (select .cse2 .cse4))) (and (= (_ bv4 32) (select v_DerPreprocessor_6 |c_~#mutexes~0.offset|)) (= .cse0 v_DerPreprocessor_7) (= .cse1 (select .cse2 |mutex_lock_ldv_list_add_~new#1.base|)) (= |c_#memory_$Pointer$.base| (store (store (store .cse3 .cse4 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse3 .cse4 (store (select .cse3 .cse4) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse4) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse3 .cse4 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (not (= .cse4 |c_~#mutexes~0.base|)) (= (_ bv4 32) (select v_DerPreprocessor_9 |c_~#mutexes~0.offset|)) (= .cse1 (select .cse5 |mutex_lock_ldv_list_add_~new#1.base|)) (= .cse0 .cse6) (= .cse6 v_DerPreprocessor_4) (= .cse0 (select |c_#memory_$Pointer$.offset| .cse4))))))))) .cse7) (and (or (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))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse9 (select (select .cse8 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse8 .cse9 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse8 .cse9 (store (select .cse8 .cse9) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse9) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse8 .cse9 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.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 ((.cse10 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3))) (and (= (select v_DerPreprocessor_3 |c_~#mutexes~0.offset|) (_ bv4 32)) (= (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|) (select .cse10 |mutex_lock_ldv_list_add_~new#1.base|)) (= v_DerPreprocessor_1 (select .cse10 .cse9))))) (= .cse9 |c_~#mutexes~0.base|))))) (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))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse11 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse12 (select (select .cse11 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse11 .cse12 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse11 .cse12 (store (select .cse11 .cse12) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse12) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse11 .cse12 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (= .cse12 |c_~#mutexes~0.base|) (exists ((v_prenex_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse12 v_prenex_60) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_61) |c_~#mutexes~0.base| v_prenex_62) .cse12 v_prenex_60) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_61) |c_~#mutexes~0.base| v_prenex_62))) (let ((.cse14 (select .cse13 .cse12))) (and (= (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|) (select .cse13 |mutex_lock_ldv_list_add_~new#1.base|)) (= v_prenex_60 .cse14) (= (select |c_#memory_$Pointer$.offset| .cse12) .cse14)))))))))) .cse7) (and (or (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))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse15 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse17 (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|)) (.cse16 (select (select .cse15 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse15 .cse16 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse15 .cse16 (store (select .cse15 .cse16) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse16) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse15 .cse16 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (= .cse16 |c_~#mutexes~0.base|) (= (_ bv4 32) (select .cse17 |c_~#mutexes~0.offset|)) (exists ((v_prenex_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse16 v_prenex_60) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_61) |c_~#mutexes~0.base| v_prenex_62) .cse16 v_prenex_60) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_61) |c_~#mutexes~0.base| v_prenex_62))) (let ((.cse19 (select .cse18 .cse16))) (and (= .cse17 (select .cse18 |mutex_lock_ldv_list_add_~new#1.base|)) (= v_prenex_60 .cse19) (= (select |c_#memory_$Pointer$.offset| .cse16) .cse19))))))))) (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))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse20 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse21 (select (select .cse20 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)) (.cse22 (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse20 .cse21 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse20 .cse21 (store (select .cse20 .cse21) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse21) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse20 .cse21 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.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 ((.cse23 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse21 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3) .cse21 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3))) (and (= (select v_DerPreprocessor_3 |c_~#mutexes~0.offset|) (_ bv4 32)) (= .cse22 (select .cse23 |mutex_lock_ldv_list_add_~new#1.base|)) (= v_DerPreprocessor_1 (select .cse23 .cse21))))) (= .cse21 |c_~#mutexes~0.base|) (= (_ bv4 32) (select .cse22 |c_~#mutexes~0.offset|))))))) .cse7) (and (exists ((v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_5 |c_~#mutexes~0.offset|) |c_~#mutexes~0.base|) (= (store (store .cse24 .cse25 v_ArrVal_87) |c_~#mutexes~0.base| v_arrayElimArr_5) |c_#memory_$Pointer$.base|))) .cse7 .cse26) (and (exists ((v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_6 |c_~#mutexes~0.offset|) |c_~#mutexes~0.base|) (= |c_#memory_$Pointer$.base| (store (store .cse24 .cse25 v_ArrVal_87) |c_~#mutexes~0.base| v_arrayElimArr_6)))) (not .cse26) .cse7))))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#mutexes~0.offset| (_ bv0 32))) is different from false [2023-02-15 10:43:38,976 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse27 (store (select |c_old(#memory_$Pointer$.base)| |c_~#mutexes~0.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|))) (let ((.cse25 (select .cse27 |c_~#mutexes~0.offset|))) (let ((.cse24 (store |c_old(#memory_$Pointer$.base)| |c_~#mutexes~0.base| .cse27)) (.cse26 (= .cse25 |c_~#mutexes~0.base|)) (.cse7 (= (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)))) (or (and (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse4 (select (select .cse3 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse2 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse4 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) .cse4 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9))) (let ((.cse5 (store (store (store (store (store (store .cse2 .cse4 v_DerPreprocessor_4) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_5) |c_~#mutexes~0.base| v_DerPreprocessor_6) .cse4 v_DerPreprocessor_4) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_5) |c_~#mutexes~0.base| v_DerPreprocessor_6))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|)) (.cse6 (select .cse5 .cse4)) (.cse0 (select .cse2 .cse4))) (and (= (_ bv4 32) (select v_DerPreprocessor_6 |c_~#mutexes~0.offset|)) (= .cse0 v_DerPreprocessor_7) (= .cse1 (select .cse2 |mutex_lock_ldv_list_add_~new#1.base|)) (= |c_#memory_$Pointer$.base| (store (store (store .cse3 .cse4 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse3 .cse4 (store (select .cse3 .cse4) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse4) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse3 .cse4 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (not (= .cse4 |c_~#mutexes~0.base|)) (= (_ bv4 32) (select v_DerPreprocessor_9 |c_~#mutexes~0.offset|)) (= .cse1 (select .cse5 |mutex_lock_ldv_list_add_~new#1.base|)) (= .cse0 .cse6) (= .cse6 v_DerPreprocessor_4) (= .cse0 (select |c_#memory_$Pointer$.offset| .cse4))))))))) .cse7) (and (or (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))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse9 (select (select .cse8 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse8 .cse9 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse8 .cse9 (store (select .cse8 .cse9) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse9) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse8 .cse9 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.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 ((.cse10 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3))) (and (= (select v_DerPreprocessor_3 |c_~#mutexes~0.offset|) (_ bv4 32)) (= (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|) (select .cse10 |mutex_lock_ldv_list_add_~new#1.base|)) (= v_DerPreprocessor_1 (select .cse10 .cse9))))) (= .cse9 |c_~#mutexes~0.base|))))) (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))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse11 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse12 (select (select .cse11 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse11 .cse12 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse11 .cse12 (store (select .cse11 .cse12) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse12) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse11 .cse12 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (= .cse12 |c_~#mutexes~0.base|) (exists ((v_prenex_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse12 v_prenex_60) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_61) |c_~#mutexes~0.base| v_prenex_62) .cse12 v_prenex_60) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_61) |c_~#mutexes~0.base| v_prenex_62))) (let ((.cse14 (select .cse13 .cse12))) (and (= (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|) (select .cse13 |mutex_lock_ldv_list_add_~new#1.base|)) (= v_prenex_60 .cse14) (= (select |c_#memory_$Pointer$.offset| .cse12) .cse14)))))))))) .cse7) (and (or (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))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse15 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse17 (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|)) (.cse16 (select (select .cse15 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse15 .cse16 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse15 .cse16 (store (select .cse15 .cse16) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse16) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse15 .cse16 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (= .cse16 |c_~#mutexes~0.base|) (= (_ bv4 32) (select .cse17 |c_~#mutexes~0.offset|)) (exists ((v_prenex_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse16 v_prenex_60) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_61) |c_~#mutexes~0.base| v_prenex_62) .cse16 v_prenex_60) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_61) |c_~#mutexes~0.base| v_prenex_62))) (let ((.cse19 (select .cse18 .cse16))) (and (= .cse17 (select .cse18 |mutex_lock_ldv_list_add_~new#1.base|)) (= v_prenex_60 .cse19) (= (select |c_#memory_$Pointer$.offset| .cse16) .cse19))))))))) (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))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse20 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse21 (select (select .cse20 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)) (.cse22 (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse20 .cse21 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse20 .cse21 (store (select .cse20 .cse21) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse21) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse20 .cse21 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.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 ((.cse23 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse21 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3) .cse21 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3))) (and (= (select v_DerPreprocessor_3 |c_~#mutexes~0.offset|) (_ bv4 32)) (= .cse22 (select .cse23 |mutex_lock_ldv_list_add_~new#1.base|)) (= v_DerPreprocessor_1 (select .cse23 .cse21))))) (= .cse21 |c_~#mutexes~0.base|) (= (_ bv4 32) (select .cse22 |c_~#mutexes~0.offset|))))))) .cse7) (and (exists ((v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_5 |c_~#mutexes~0.offset|) |c_~#mutexes~0.base|) (= (store (store .cse24 .cse25 v_ArrVal_87) |c_~#mutexes~0.base| v_arrayElimArr_5) |c_#memory_$Pointer$.base|))) .cse7 .cse26) (and (exists ((v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_6 |c_~#mutexes~0.offset|) |c_~#mutexes~0.base|) (= |c_#memory_$Pointer$.base| (store (store .cse24 .cse25 v_ArrVal_87) |c_~#mutexes~0.base| v_arrayElimArr_6)))) (not .cse26) .cse7))))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#mutexes~0.offset| (_ bv0 32))) is different from true [2023-02-15 10:43:48,350 INFO L173 IndexEqualityManager]: detected equality via solver