./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:42:44,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:42:44,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:42:44,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:42:44,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:42:44,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:42:44,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:42:44,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:42:44,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:42:44,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:42:44,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:42:44,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:42:44,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:42:44,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:42:44,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:42:44,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:42:44,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:42:44,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:42:44,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:42:44,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:42:44,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:42:44,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:42:44,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:42:44,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:42:44,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:42:44,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:42:44,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:42:44,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:42:44,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:42:44,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:42:44,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:42:44,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:42:44,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:42:44,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:42:44,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:42:44,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:42:44,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:42:44,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:42:44,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:42:44,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:42:44,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:42:44,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:42:44,806 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:42:44,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:42:44,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:42:44,807 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:42:44,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:42:44,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:42:44,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:42:44,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:42:44,809 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:42:44,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:42:44,810 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:42:44,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:42:44,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:42:44,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:42:44,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:42:44,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:42:44,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:42:44,811 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:42:44,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:42:44,811 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:42:44,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:42:44,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:42:44,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:42:44,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:42:44,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:42:44,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:42:44,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:42:44,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:42:44,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:42:44,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:42:44,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:42:44,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:42:44,814 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:42:44,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:42:44,814 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:42:44,815 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 -> cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 [2023-02-15 19:42:45,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:42:45,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:42:45,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:42:45,102 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:42:45,103 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:42:45,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex.i [2023-02-15 19:42:46,278 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:42:46,549 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:42:46,550 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i [2023-02-15 19:42:46,566 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaec37939/fcecb9e71cc94048b1a7034477bb1deb/FLAG1e8527413 [2023-02-15 19:42:46,585 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaec37939/fcecb9e71cc94048b1a7034477bb1deb [2023-02-15 19:42:46,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:42:46,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:42:46,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:42:46,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:42:46,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:42:46,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:42:46" (1/1) ... [2023-02-15 19:42:46,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195e607d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:46, skipping insertion in model container [2023-02-15 19:42:46,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:42:46" (1/1) ... [2023-02-15 19:42:46,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:42:46,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:42:46,951 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.i[25842,25855] [2023-02-15 19:42:46,959 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.i[25967,25980] [2023-02-15 19:42:46,963 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.i[26082,26095] [2023-02-15 19:42:46,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:42:46,982 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:42:47,044 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.i[25842,25855] [2023-02-15 19:42:47,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.i[25967,25980] [2023-02-15 19:42:47,046 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.i[26082,26095] [2023-02-15 19:42:47,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:42:47,074 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:42:47,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47 WrapperNode [2023-02-15 19:42:47,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:42:47,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:42:47,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:42:47,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:42:47,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,135 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 129 [2023-02-15 19:42:47,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:42:47,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:42:47,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:42:47,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:42:47,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,189 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:42:47,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:42:47,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:42:47,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:42:47,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (1/1) ... [2023-02-15 19:42:47,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:42:47,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:42:47,274 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 19:42:47,283 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 19:42:47,305 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-15 19:42:47,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-15 19:42:47,305 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-02-15 19:42:47,305 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-02-15 19:42:47,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:42:47,305 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-02-15 19:42:47,306 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-02-15 19:42:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:42:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:42:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-02-15 19:42:47,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-02-15 19:42:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:42:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:42:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:42:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:42:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-02-15 19:42:47,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-02-15 19:42:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:42:47,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:42:47,449 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:42:47,451 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:42:47,694 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:42:47,700 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:42:47,700 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 19:42:47,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:42:47 BoogieIcfgContainer [2023-02-15 19:42:47,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:42:47,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:42:47,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:42:47,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:42:47,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:42:46" (1/3) ... [2023-02-15 19:42:47,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b10a10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:42:47, skipping insertion in model container [2023-02-15 19:42:47,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:47" (2/3) ... [2023-02-15 19:42:47,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b10a10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:42:47, skipping insertion in model container [2023-02-15 19:42:47,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:42:47" (3/3) ... [2023-02-15 19:42:47,720 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex.i [2023-02-15 19:42:47,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:42:47,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-02-15 19:42:47,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:42:47,794 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;@4e45aaee, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:42:47,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-02-15 19:42:47,799 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 19:42:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 19:42:47,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:47,807 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 19:42:47,808 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 19:42:47,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:47,814 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2023-02-15 19:42:47,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:47,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082418012] [2023-02-15 19:42:47,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:47,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:48,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:48,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:42:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:48,101 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 19:42:48,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:48,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082418012] [2023-02-15 19:42:48,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082418012] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:42:48,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:42:48,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:42:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084320880] [2023-02-15 19:42:48,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:42:48,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:42:48,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:42:48,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:42:48,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:42:48,146 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 19:42:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:42:48,273 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2023-02-15 19:42:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:42:48,275 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 19:42:48,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:42:48,284 INFO L225 Difference]: With dead ends: 147 [2023-02-15 19:42:48,284 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 19:42:48,288 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 19:42:48,293 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 19:42:48,295 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 19:42:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 19:42:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2023-02-15 19:42:48,332 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 19:42:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-02-15 19:42:48,335 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2023-02-15 19:42:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:42:48,335 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-02-15 19:42:48,335 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 19:42:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-02-15 19:42:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 19:42:48,337 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:48,337 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 19:42:48,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:42:48,338 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 19:42:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2023-02-15 19:42:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:48,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78503862] [2023-02-15 19:42:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:48,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:48,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:48,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:42:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:48,583 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 19:42:48,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:48,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78503862] [2023-02-15 19:42:48,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78503862] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:42:48,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:42:48,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:42:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530534081] [2023-02-15 19:42:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:42:48,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:42:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:42:48,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:42:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:42:48,594 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 19:42:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:42:48,816 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-02-15 19:42:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:42:48,817 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 19:42:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:42:48,822 INFO L225 Difference]: With dead ends: 82 [2023-02-15 19:42:48,822 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 19:42:48,823 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 19:42:48,824 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:42:48,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 141 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:42:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 19:42:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2023-02-15 19:42:48,843 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 19:42:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-02-15 19:42:48,844 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2023-02-15 19:42:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:42:48,845 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-02-15 19:42:48,845 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 19:42:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-02-15 19:42:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 19:42:48,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:48,847 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 19:42:48,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:42:48,847 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 19:42:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2023-02-15 19:42:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:48,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468481055] [2023-02-15 19:42:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:42:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,242 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 19:42:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468481055] [2023-02-15 19:42:49,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468481055] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:42:49,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:42:49,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:42:49,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441154650] [2023-02-15 19:42:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:42:49,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:42:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:42:49,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:42:49,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:42:49,250 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 19:42:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:42:49,736 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2023-02-15 19:42:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 19:42:49,737 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 19:42:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:42:49,738 INFO L225 Difference]: With dead ends: 206 [2023-02-15 19:42:49,739 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 19:42:49,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 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 19:42:49,741 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 142 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:42:49,741 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.3s Time] [2023-02-15 19:42:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 19:42:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2023-02-15 19:42:49,755 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 19:42:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-02-15 19:42:49,757 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2023-02-15 19:42:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:42:49,757 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-02-15 19:42:49,757 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 19:42:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-02-15 19:42:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 19:42:49,760 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:49,760 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 19:42:49,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:42:49,760 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 19:42:49,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2023-02-15 19:42:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:49,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123568875] [2023-02-15 19:42:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:42:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:42:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 19:42:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:42:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-15 19:42:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:49,923 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 19:42:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:49,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123568875] [2023-02-15 19:42:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123568875] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:42:49,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675983187] [2023-02-15 19:42:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:49,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:42:49,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:42:49,927 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 19:42:49,929 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 19:42:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 19:42:50,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:42:50,124 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 19:42:50,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:42:50,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675983187] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:42:50,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:42:50,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-15 19:42:50,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909571300] [2023-02-15 19:42:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:42:50,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:42:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:42:50,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:42:50,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:42:50,127 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 19:42:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:42:50,148 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2023-02-15 19:42:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:42:50,149 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 19:42:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:42:50,151 INFO L225 Difference]: With dead ends: 219 [2023-02-15 19:42:50,151 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 19:42:50,152 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 19:42:50,153 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 19:42:50,153 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 19:42:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 19:42:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-02-15 19:42:50,165 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 19:42:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2023-02-15 19:42:50,167 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2023-02-15 19:42:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:42:50,167 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2023-02-15 19:42:50,168 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 19:42:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2023-02-15 19:42:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 19:42:50,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:50,170 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 19:42:50,176 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 19:42:50,375 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 19:42:50,375 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 19:42:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2023-02-15 19:42:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:50,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131739146] [2023-02-15 19:42:50,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:52,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:52,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:42:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:53,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:42:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:53,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:42:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:53,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:42:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:53,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-15 19:42:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 19:42:54,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:54,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131739146] [2023-02-15 19:42:54,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131739146] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:42:54,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481294256] [2023-02-15 19:42:54,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:54,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:42:54,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:42:54,004 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 19:42:54,008 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 19:42:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:54,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 202 conjunts are in the unsatisfiable core [2023-02-15 19:42:54,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:42:54,495 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:42:54,496 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 19:42:54,743 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 19:42:54,743 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 19:42:54,943 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 19:42:54,947 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 19:42:56,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,540 INFO L321 Elim1Store]: treesize reduction 158, result has 24.0 percent of original size [2023-02-15 19:42:56,541 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 204 treesize of output 165 [2023-02-15 19:42:56,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,583 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 48 treesize of output 28 [2023-02-15 19:42:56,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,598 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 112 treesize of output 80 [2023-02-15 19:42:56,618 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-15 19:42:56,619 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 19:42:56,642 INFO L321 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2023-02-15 19:42:56,643 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 116 treesize of output 96 [2023-02-15 19:42:56,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:42:56,656 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 131 treesize of output 99 [2023-02-15 19:42:56,662 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 13 treesize of output 11 [2023-02-15 19:42:56,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,684 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 19:42:56,684 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 33 treesize of output 37 [2023-02-15 19:42:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 19:42:57,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:43:00,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481294256] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:43:00,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:43:00,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2023-02-15 19:43:00,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316671581] [2023-02-15 19:43:00,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:43:00,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-15 19:43:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:43:00,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-15 19:43:00,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4034, Unknown=7, NotChecked=0, Total=4290 [2023-02-15 19:43:00,006 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 59 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 41 states have internal predecessors, (83), 16 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-15 19:43:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:08,185 INFO L93 Difference]: Finished difference Result 307 states and 378 transitions. [2023-02-15 19:43:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-02-15 19:43:08,186 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 41 states have internal predecessors, (83), 16 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) Word has length 63 [2023-02-15 19:43:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:08,188 INFO L225 Difference]: With dead ends: 307 [2023-02-15 19:43:08,188 INFO L226 Difference]: Without dead ends: 235 [2023-02-15 19:43:08,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2932 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1055, Invalid=11148, Unknown=7, NotChecked=0, Total=12210 [2023-02-15 19:43:08,199 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 828 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 4635 mSolverCounterSat, 262 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 4906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 4635 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:08,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1365 Invalid, 4906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 4635 Invalid, 9 Unknown, 0 Unchecked, 4.3s Time] [2023-02-15 19:43:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-02-15 19:43:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 157. [2023-02-15 19:43:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 120 states have internal predecessors, (136), 22 states have call successors, (22), 11 states have call predecessors, (22), 18 states have return successors, (37), 25 states have call predecessors, (37), 22 states have call successors, (37) [2023-02-15 19:43:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2023-02-15 19:43:08,231 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 63 [2023-02-15 19:43:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:08,232 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2023-02-15 19:43:08,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 41 states have internal predecessors, (83), 16 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-15 19:43:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2023-02-15 19:43:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 19:43:08,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:08,239 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 19:43:08,255 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 19:43:08,446 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 19:43:08,447 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 19:43:08,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:08,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2102607608, now seen corresponding path program 1 times [2023-02-15 19:43:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:08,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835123989] [2023-02-15 19:43:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 19:43:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-15 19:43:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,793 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 19:43:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:08,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835123989] [2023-02-15 19:43:08,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835123989] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:43:08,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429118936] [2023-02-15 19:43:08,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:08,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:43:08,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:43:08,797 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 19:43:08,799 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 19:43:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 19:43:08,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:09,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 19:43:09,094 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 19:43:09,243 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 19:43:09,249 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 19:43:09,482 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 19:43:09,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:09,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429118936] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:09,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:43:09,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2023-02-15 19:43:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188765079] [2023-02-15 19:43:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:09,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 19:43:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:43:09,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 19:43:09,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:43:09,486 INFO L87 Difference]: Start difference. First operand 157 states and 195 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 19:43:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:10,020 INFO L93 Difference]: Finished difference Result 325 states and 395 transitions. [2023-02-15 19:43:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 19:43:10,020 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 19:43:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:10,022 INFO L225 Difference]: With dead ends: 325 [2023-02-15 19:43:10,022 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 19:43:10,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-02-15 19:43:10,023 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 174 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:10,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 252 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:43:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 19:43:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2023-02-15 19:43:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 109 states have internal predecessors, (121), 18 states have call successors, (18), 11 states have call predecessors, (18), 16 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2023-02-15 19:43:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 166 transitions. [2023-02-15 19:43:10,038 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 166 transitions. Word has length 72 [2023-02-15 19:43:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:10,039 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 166 transitions. [2023-02-15 19:43:10,039 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 19:43:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 166 transitions. [2023-02-15 19:43:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 19:43:10,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:10,040 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 19:43:10,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 19:43:10,246 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 19:43:10,246 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 19:43:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1485354123, now seen corresponding path program 1 times [2023-02-15 19:43:10,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:10,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680350282] [2023-02-15 19:43:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:10,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:13,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:13,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:43:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:13,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:43:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-15 19:43:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:14,310 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 19:43:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:14,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680350282] [2023-02-15 19:43:14,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680350282] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:43:14,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597910947] [2023-02-15 19:43:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:14,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:43:14,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:43:14,313 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 19:43:14,316 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 19:43:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:14,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 199 conjunts are in the unsatisfiable core [2023-02-15 19:43:14,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:14,746 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:43:14,746 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 19:43:15,001 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:43:15,001 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 19:43:15,049 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 19:43:15,053 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 19:43:16,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:16,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:16,460 INFO L321 Elim1Store]: treesize reduction 191, result has 14.0 percent of original size [2023-02-15 19:43:16,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 167 [2023-02-15 19:43:16,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:16,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:16,477 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 49 treesize of output 38 [2023-02-15 19:43:16,480 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 19:43:16,502 INFO L321 Elim1Store]: treesize reduction 64, result has 7.2 percent of original size [2023-02-15 19:43:16,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 199 treesize of output 186 [2023-02-15 19:43:16,514 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 176 treesize of output 148 [2023-02-15 19:43:16,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 150 treesize of output 100 [2023-02-15 19:43:16,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:16,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2023-02-15 19:43:16,535 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 11 treesize of output 15 [2023-02-15 19:43:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:43:17,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:43:20,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597910947] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:43:20,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:43:20,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2023-02-15 19:43:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071164110] [2023-02-15 19:43:20,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:43:20,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 19:43:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:43:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 19:43:20,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2932, Unknown=14, NotChecked=0, Total=3192 [2023-02-15 19:43:20,024 INFO L87 Difference]: Start difference. First operand 141 states and 166 transitions. Second operand has 51 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 40 states have internal predecessors, (89), 12 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 12 states have call successors, (16) [2023-02-15 19:43:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:26,911 INFO L93 Difference]: Finished difference Result 326 states and 383 transitions. [2023-02-15 19:43:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-15 19:43:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 40 states have internal predecessors, (89), 12 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 12 states have call successors, (16) Word has length 66 [2023-02-15 19:43:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:26,913 INFO L225 Difference]: With dead ends: 326 [2023-02-15 19:43:26,913 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 19:43:26,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1159, Invalid=9303, Unknown=44, NotChecked=0, Total=10506 [2023-02-15 19:43:26,916 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 769 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 2771 mSolverCounterSat, 201 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 3013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 2771 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:26,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 726 Invalid, 3013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 2771 Invalid, 41 Unknown, 0 Unchecked, 3.1s Time] [2023-02-15 19:43:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 19:43:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 147. [2023-02-15 19:43:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 116 states have internal predecessors, (128), 17 states have call successors, (17), 12 states have call predecessors, (17), 16 states have return successors, (25), 18 states have call predecessors, (25), 17 states have call successors, (25) [2023-02-15 19:43:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2023-02-15 19:43:26,936 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 66 [2023-02-15 19:43:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:26,936 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2023-02-15 19:43:26,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 40 states have internal predecessors, (89), 12 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 12 states have call successors, (16) [2023-02-15 19:43:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2023-02-15 19:43:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-02-15 19:43:26,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:26,938 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 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 19:43:26,949 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 19:43:27,145 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 19:43:27,145 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2001187500, now seen corresponding path program 1 times [2023-02-15 19:43:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:27,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974640827] [2023-02-15 19:43:27,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:27,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:43:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:43:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 19:43:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:43:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 19:43:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 19:43:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 19:43:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-02-15 19:43:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:27,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974640827] [2023-02-15 19:43:27,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974640827] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:27,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:27,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-15 19:43:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692008267] [2023-02-15 19:43:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:27,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 19:43:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:43:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 19:43:27,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:43:27,964 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-15 19:43:28,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:28,655 INFO L93 Difference]: Finished difference Result 236 states and 278 transitions. [2023-02-15 19:43:28,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 19:43:28,655 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 104 [2023-02-15 19:43:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:28,657 INFO L225 Difference]: With dead ends: 236 [2023-02-15 19:43:28,657 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 19:43:28,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 19:43:28,658 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 254 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:28,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 329 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:43:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 19:43:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 131. [2023-02-15 19:43:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 99 states have (on average 1.121212121212121) internal successors, (111), 101 states have internal predecessors, (111), 17 states have call successors, (17), 12 states have call predecessors, (17), 13 states have return successors, (20), 17 states have call predecessors, (20), 17 states have call successors, (20) [2023-02-15 19:43:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2023-02-15 19:43:28,674 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 104 [2023-02-15 19:43:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:28,674 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2023-02-15 19:43:28,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-15 19:43:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2023-02-15 19:43:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-02-15 19:43:28,676 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:28,676 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 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, 1] [2023-02-15 19:43:28,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:43:28,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:28,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:28,677 INFO L85 PathProgramCache]: Analyzing trace with hash -426584195, now seen corresponding path program 1 times [2023-02-15 19:43:28,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:28,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283779544] [2023-02-15 19:43:28,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:43:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:43:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 19:43:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:43:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 19:43:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 19:43:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 19:43:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-02-15 19:43:28,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:28,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283779544] [2023-02-15 19:43:28,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283779544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:28,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:28,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:43:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129434663] [2023-02-15 19:43:28,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:28,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:43:28,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:43:28,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:43:28,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:43:28,866 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-02-15 19:43:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:29,078 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2023-02-15 19:43:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:43:29,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2023-02-15 19:43:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:29,082 INFO L225 Difference]: With dead ends: 143 [2023-02-15 19:43:29,082 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 19:43:29,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:43:29,084 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:29,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 148 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:43:29,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 19:43:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2023-02-15 19:43:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 105 states have (on average 1.1142857142857143) internal successors, (117), 107 states have internal predecessors, (117), 17 states have call successors, (17), 12 states have call predecessors, (17), 15 states have return successors, (22), 19 states have call predecessors, (22), 17 states have call successors, (22) [2023-02-15 19:43:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2023-02-15 19:43:29,102 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 104 [2023-02-15 19:43:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:29,103 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2023-02-15 19:43:29,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-02-15 19:43:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2023-02-15 19:43:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-02-15 19:43:29,105 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:29,105 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 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 19:43:29,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 19:43:29,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:29,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1390622775, now seen corresponding path program 2 times [2023-02-15 19:43:29,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:29,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941151654] [2023-02-15 19:43:29,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:29,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:31,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:31,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:31,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:43:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:43:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 19:43:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:32,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:43:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:32,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 19:43:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:32,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 19:43:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:33,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 19:43:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 58 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-15 19:43:33,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:33,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941151654] [2023-02-15 19:43:33,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941151654] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:43:33,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41673152] [2023-02-15 19:43:33,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:43:33,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:43:33,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:43:33,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:43:33,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 19:43:33,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:43:33,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:43:33,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 206 conjunts are in the unsatisfiable core [2023-02-15 19:43:33,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:33,815 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 6 treesize of output 5 [2023-02-15 19:43:34,184 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 0 case distinctions, treesize of input 12 treesize of output 9 [2023-02-15 19:43:34,240 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:43:34,241 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 19:43:34,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-15 19:43:34,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-15 19:43:35,411 INFO L321 Elim1Store]: treesize reduction 188, result has 34.0 percent of original size [2023-02-15 19:43:35,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 260 treesize of output 340 [2023-02-15 19:43:35,615 INFO L321 Elim1Store]: treesize reduction 84, result has 40.4 percent of original size [2023-02-15 19:43:35,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 118 [2023-02-15 19:43:35,651 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2023-02-15 19:43:35,936 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 19:43:35,937 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 163 [2023-02-15 19:43:36,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:37,008 INFO L321 Elim1Store]: treesize reduction 29, result has 25.6 percent of original size [2023-02-15 19:43:37,009 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 613 treesize of output 565 [2023-02-15 19:43:37,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 361 [2023-02-15 19:43:37,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 351 treesize of output 355 [2023-02-15 19:43:37,305 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 19:43:37,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2023-02-15 19:43:37,406 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 19:43:37,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2023-02-15 19:43:37,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 286 [2023-02-15 19:43:37,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 574 treesize of output 441 [2023-02-15 19:43:37,779 INFO L321 Elim1Store]: treesize reduction 99, result has 25.6 percent of original size [2023-02-15 19:43:37,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 120 [2023-02-15 19:43:37,812 INFO L321 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2023-02-15 19:43:37,812 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 3 case distinctions, treesize of input 60 treesize of output 13 [2023-02-15 19:43:37,887 INFO L321 Elim1Store]: treesize reduction 142, result has 0.7 percent of original size [2023-02-15 19:43:37,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 87 treesize of output 1 [2023-02-15 19:43:38,108 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 672 treesize of output 568 [2023-02-15 19:43:39,269 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:39,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:39,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:39,296 INFO L321 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2023-02-15 19:43:39,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 671 treesize of output 603 [2023-02-15 19:43:39,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:39,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:39,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:39,501 INFO L321 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2023-02-15 19:43:39,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1242 treesize of output 1114 [2023-02-15 19:43:39,756 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-15 19:43:39,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:43:39,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 19:43:39,970 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:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java: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.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) 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 19:43:39,975 INFO L158 Benchmark]: Toolchain (without parser) took 53386.26ms. Allocated memory was 138.4MB in the beginning and 509.6MB in the end (delta: 371.2MB). Free memory was 98.8MB in the beginning and 355.4MB in the end (delta: -256.6MB). Peak memory consumption was 304.1MB. Max. memory is 16.1GB. [2023-02-15 19:43:39,975 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 88.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:43:39,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.67ms. Allocated memory is still 138.4MB. Free memory was 98.6MB in the beginning and 79.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 19:43:39,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.53ms. Allocated memory is still 138.4MB. Free memory was 79.3MB in the beginning and 76.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:43:39,976 INFO L158 Benchmark]: Boogie Preprocessor took 60.62ms. Allocated memory is still 138.4MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:43:39,976 INFO L158 Benchmark]: RCFGBuilder took 515.93ms. Allocated memory is still 138.4MB. Free memory was 74.8MB in the beginning and 89.7MB in the end (delta: -14.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 19:43:39,977 INFO L158 Benchmark]: TraceAbstraction took 52259.23ms. Allocated memory was 138.4MB in the beginning and 509.6MB in the end (delta: 371.2MB). Free memory was 89.1MB in the beginning and 355.4MB in the end (delta: -266.4MB). Peak memory consumption was 297.5MB. Max. memory is 16.1GB. [2023-02-15 19:43:39,978 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.19ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 88.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.67ms. Allocated memory is still 138.4MB. Free memory was 98.6MB in the beginning and 79.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.53ms. Allocated memory is still 138.4MB. Free memory was 79.3MB in the beginning and 76.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.62ms. Allocated memory is still 138.4MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 515.93ms. Allocated memory is still 138.4MB. Free memory was 74.8MB in the beginning and 89.7MB in the end (delta: -14.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 52259.23ms. Allocated memory was 138.4MB in the beginning and 509.6MB in the end (delta: 371.2MB). Free memory was 89.1MB in the beginning and 355.4MB in the end (delta: -266.4MB). Peak memory consumption was 297.5MB. 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 19:43:40,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:43:42,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:43:42,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:43:42,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:43:42,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:43:42,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:43:42,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:43:42,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:43:42,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:43:42,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:43:42,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:43:42,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:43:42,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:43:42,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:43:42,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:43:42,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:43:42,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:43:42,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:43:42,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:43:42,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:43:42,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:43:42,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:43:42,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:43:42,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:43:42,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:43:42,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:43:42,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:43:42,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:43:42,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:43:42,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:43:42,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:43:42,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:43:42,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:43:42,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:43:42,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:43:42,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:43:42,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:43:42,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:43:42,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:43:42,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:43:42,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:43:42,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-15 19:43:42,259 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:43:42,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:43:42,260 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:43:42,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:43:42,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:43:42,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:43:42,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:43:42,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:43:42,263 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:43:42,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:43:42,264 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:43:42,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:43:42,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:43:42,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:43:42,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:43:42,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:43:42,265 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 19:43:42,265 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 19:43:42,266 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 19:43:42,266 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:43:42,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:43:42,266 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:43:42,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:43:42,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:43:42,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:43:42,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:43:42,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:43:42,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:43:42,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:43:42,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:43:42,268 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 19:43:42,268 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 19:43:42,269 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:43:42,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:43:42,269 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:43:42,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:43:42,270 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 19:43:42,270 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:43:42,270 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 -> cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 [2023-02-15 19:43:42,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:43:42,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:43:42,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:43:42,653 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:43:42,654 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:43:42,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex.i [2023-02-15 19:43:43,868 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:43:44,186 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:43:44,190 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i [2023-02-15 19:43:44,211 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1493b8c/c1c4d5e398de4e9e959dbc081156c45c/FLAG29494b6c8 [2023-02-15 19:43:44,231 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1493b8c/c1c4d5e398de4e9e959dbc081156c45c [2023-02-15 19:43:44,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:43:44,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:43:44,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:43:44,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:43:44,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:43:44,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:44,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0630b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44, skipping insertion in model container [2023-02-15 19:43:44,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:44,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:43:44,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:43:44,679 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.i[25842,25855] [2023-02-15 19:43:44,686 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.i[25967,25980] [2023-02-15 19:43:44,688 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.i[26082,26095] [2023-02-15 19:43:44,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:43:44,707 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 19:43:44,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:43:44,783 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.i[25842,25855] [2023-02-15 19:43:44,785 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.i[25967,25980] [2023-02-15 19:43:44,787 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.i[26082,26095] [2023-02-15 19:43:44,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:43:44,796 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:43:44,841 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.i[25842,25855] [2023-02-15 19:43:44,844 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.i[25967,25980] [2023-02-15 19:43:44,845 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.i[26082,26095] [2023-02-15 19:43:44,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:43:44,883 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:43:44,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44 WrapperNode [2023-02-15 19:43:44,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:43:44,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:43:44,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:43:44,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:43:44,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:44,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:44,953 INFO L138 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 125 [2023-02-15 19:43:44,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:43:44,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:43:44,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:43:44,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:43:44,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:44,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:44,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:44,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:44,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:45,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:45,007 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:45,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:45,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:43:45,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:43:45,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:43:45,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:43:45,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (1/1) ... [2023-02-15 19:43:45,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:43:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:43:45,050 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 19:43:45,076 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 19:43:45,095 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-15 19:43:45,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-15 19:43:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-02-15 19:43:45,096 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-02-15 19:43:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:43:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-02-15 19:43:45,097 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-02-15 19:43:45,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:43:45,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:43:45,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-02-15 19:43:45,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-02-15 19:43:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:43:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:43:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:43:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 19:43:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-02-15 19:43:45,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-02-15 19:43:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:43:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:43:45,252 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:43:45,254 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:43:45,590 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:43:45,596 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:43:45,597 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 19:43:45,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:43:45 BoogieIcfgContainer [2023-02-15 19:43:45,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:43:45,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:43:45,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:43:45,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:43:45,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:43:44" (1/3) ... [2023-02-15 19:43:45,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61385a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:43:45, skipping insertion in model container [2023-02-15 19:43:45,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:44" (2/3) ... [2023-02-15 19:43:45,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61385a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:43:45, skipping insertion in model container [2023-02-15 19:43:45,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:43:45" (3/3) ... [2023-02-15 19:43:45,607 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex.i [2023-02-15 19:43:45,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:43:45,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-02-15 19:43:45,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:43:45,665 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;@3a035243, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:43:45,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-02-15 19:43:45,669 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 19:43:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:43:45,676 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:45,677 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 19:43:45,677 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 19:43:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:45,682 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2023-02-15 19:43:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:45,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466499000] [2023-02-15 19:43:45,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:45,702 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 19:43:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:45,713 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 19:43:45,757 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 19:43:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:45,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 19:43:45,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:45,888 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 19:43:45,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:45,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466499000] [2023-02-15 19:43:45,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466499000] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:45,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:45,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:43:45,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952992239] [2023-02-15 19:43:45,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:45,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:43:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:45,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:43:45,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:43:45,940 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 19:43:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:45,970 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2023-02-15 19:43:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:43:45,975 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 19:43:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:45,984 INFO L225 Difference]: With dead ends: 130 [2023-02-15 19:43:45,984 INFO L226 Difference]: Without dead ends: 62 [2023-02-15 19:43:45,989 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 19:43:45,993 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 19:43:45,995 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 19:43:46,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-15 19:43:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-02-15 19:43:46,032 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 19:43:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-02-15 19:43:46,036 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2023-02-15 19:43:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:46,037 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-02-15 19:43:46,037 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 19:43:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-02-15 19:43:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:43:46,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:46,041 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 19:43:46,055 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 19:43:46,252 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 19:43:46,252 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 19:43:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2023-02-15 19:43:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:46,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42503080] [2023-02-15 19:43:46,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:46,255 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 19:43:46,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:46,257 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 19:43:46,260 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 19:43:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:46,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 19:43:46,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:46,724 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 19:43:46,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:46,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:46,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42503080] [2023-02-15 19:43:46,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42503080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:46,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:46,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:43:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304840861] [2023-02-15 19:43:46,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:46,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:43:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:43:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:43:46,728 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 19:43:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:47,184 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2023-02-15 19:43:47,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:43:47,185 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 19:43:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:47,188 INFO L225 Difference]: With dead ends: 170 [2023-02-15 19:43:47,189 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 19:43:47,189 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 19:43:47,190 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 59 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:47,191 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.4s Time] [2023-02-15 19:43:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 19:43:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2023-02-15 19:43:47,221 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 19:43:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2023-02-15 19:43:47,229 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2023-02-15 19:43:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:47,230 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2023-02-15 19:43:47,230 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 19:43:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2023-02-15 19:43:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:43:47,232 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:47,232 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 19:43:47,245 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 (3)] Ended with exit code 0 [2023-02-15 19:43:47,441 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 19:43:47,442 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 19:43:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2023-02-15 19:43:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:47,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421265475] [2023-02-15 19:43:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:47,444 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 19:43:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:47,445 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 19:43:47,448 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 19:43:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:47,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:43:47,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:47,598 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 19:43:47,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:47,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:47,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421265475] [2023-02-15 19:43:47,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421265475] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:47,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:47,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:43:47,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022421791] [2023-02-15 19:43:47,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:47,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:43:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:47,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:43:47,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:43:47,603 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 19:43:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:47,634 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2023-02-15 19:43:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:43:47,635 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 19:43:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:47,641 INFO L225 Difference]: With dead ends: 108 [2023-02-15 19:43:47,641 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 19:43:47,642 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 19:43:47,645 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 19:43:47,646 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 19:43:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 19:43:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2023-02-15 19:43:47,662 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 19:43:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2023-02-15 19:43:47,663 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2023-02-15 19:43:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:47,663 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2023-02-15 19:43:47,664 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 19:43:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2023-02-15 19:43:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 19:43:47,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:47,666 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 19:43:47,679 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 19:43:47,876 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 19:43:47,877 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 19:43:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2023-02-15 19:43:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:47,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679614568] [2023-02-15 19:43:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:47,879 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 19:43:47,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:47,880 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 19:43:47,889 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 19:43:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:48,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 19:43:48,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:48,181 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 19:43:48,191 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 19:43:48,429 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 19:43:48,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:48,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:48,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679614568] [2023-02-15 19:43:48,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679614568] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:48,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:48,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 19:43:48,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766246342] [2023-02-15 19:43:48,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:48,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 19:43:48,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:48,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 19:43:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:43:48,433 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 19:43:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:50,034 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2023-02-15 19:43:50,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 19:43:50,037 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 19:43:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:50,040 INFO L225 Difference]: With dead ends: 268 [2023-02-15 19:43:50,043 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 19:43:50,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-02-15 19:43:50,047 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 19:43:50,049 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 19:43:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 19:43:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2023-02-15 19:43:50,064 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 19:43:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2023-02-15 19:43:50,065 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2023-02-15 19:43:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:50,066 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2023-02-15 19:43:50,066 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 19:43:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2023-02-15 19:43:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 19:43:50,067 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:50,068 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 19:43:50,081 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 19:43:50,279 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 19:43:50,279 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 19:43:50,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2023-02-15 19:43:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:50,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329807437] [2023-02-15 19:43:50,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:50,281 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 19:43:50,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:50,282 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 19:43:50,285 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 19:43:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:50,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:43:50,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:50,431 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 19:43:50,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:50,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:50,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329807437] [2023-02-15 19:43:50,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329807437] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:50,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:50,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:43:50,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629732236] [2023-02-15 19:43:50,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:50,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:43:50,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:50,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:43:50,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:43:50,434 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 19:43:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:50,456 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2023-02-15 19:43:50,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:43:50,457 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 19:43:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:50,458 INFO L225 Difference]: With dead ends: 196 [2023-02-15 19:43:50,459 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 19:43:50,459 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 19:43:50,460 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 19:43:50,460 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 19:43:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 19:43:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-02-15 19:43:50,470 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 19:43:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2023-02-15 19:43:50,471 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2023-02-15 19:43:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:50,472 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2023-02-15 19:43:50,472 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 19:43:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2023-02-15 19:43:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 19:43:50,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:50,473 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 19:43:50,488 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 (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:43:50,684 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 19:43:50,684 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 19:43:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2023-02-15 19:43:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:50,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585561286] [2023-02-15 19:43:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:50,686 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 19:43:50,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:50,687 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 19:43:50,711 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 19:43:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:50,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 97 conjunts are in the unsatisfiable core [2023-02-15 19:43:50,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:50,947 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 6 treesize of output 7 [2023-02-15 19:43:51,185 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 19:43:51,186 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 19 treesize of output 27 [2023-02-15 19:43:51,296 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 19:43:52,199 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-02-15 19:43:52,200 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 194 treesize of output 281 [2023-02-15 19:43:52,247 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 19:43:52,282 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 19:43:52,309 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 19:43:52,857 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:52,864 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:52,883 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 19:43:52,884 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 204 [2023-02-15 19:43:52,908 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 19:43:52,968 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 19:43:52,982 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 19:43:53,058 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2023-02-15 19:43:53,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 16 [2023-02-15 19:43:53,064 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 19:43:53,125 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.offset (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32)) |c___ldv_list_add_#in~new.base|)))) (let ((.cse0 (store (store (select .cse1 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))) (store (store (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_91) |c___ldv_list_add_#in~new.base| .cse0) |c___ldv_list_add_#in~prev.base| (store (select (store .cse1 |c___ldv_list_add_#in~new.base| .cse0) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))))) (= |c_~#mutexes~0.offset| (_ bv0 32)) (let ((.cse3 (= |c___ldv_list_add_#in~prev.base| |c___ldv_list_add_#in~new.base|)) (.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.offset|))) (or (and .cse2 .cse3) (and (not .cse3) (let ((.cse7 (= |c___ldv_list_add_#in~prev.base| |c___ldv_list_add_#in~next.base|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|))) (or (and .cse2 (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9))) (let ((.cse4 (select .cse5 |c___ldv_list_add_#in~next.base|))) (and (= (select v_DerPreprocessor_9 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.offset|) (= v_DerPreprocessor_7 .cse4) (= (select .cse5 |c___ldv_list_add_#in~new.base|) .cse6) (= .cse4 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)))))) (not .cse7)) (and .cse2 .cse7 (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (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| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_1) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_3) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_1) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_3))) (let ((.cse9 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_11) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_12) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_11) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_12)) (.cse8 (select .cse10 |c___ldv_list_add_#in~new.base|))) (and (= .cse6 .cse8) (= (select v_DerPreprocessor_3 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.offset|) (= v_DerPreprocessor_10 (select .cse9 |c___ldv_list_add_#in~next.base|)) (= (select v_DerPreprocessor_12 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.offset|) (= (select .cse9 |c___ldv_list_add_#in~new.base|) .cse8) (= v_DerPreprocessor_1 (select .cse10 |c___ldv_list_add_#in~next.base|))))))))))))) is different from true [2023-02-15 19:44:04,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:46:01,139 WARN L233 SmtUtils]: Spent 1.94m on a formula simplification. DAG size of input: 63 DAG size of output: 32 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-15 19:46:01,140 INFO L321 Elim1Store]: treesize reduction 104, result has 33.8 percent of original size [2023-02-15 19:46:01,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 12 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 15 new quantified variables, introduced 9 case distinctions, treesize of input 1294 treesize of output 1069