./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:10:51,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:10:51,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:10:51,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:10:51,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:10:51,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:10:51,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:10:51,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:10:51,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:10:51,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:10:51,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:10:51,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:10:51,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:10:51,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:10:51,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:10:51,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:10:51,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:10:51,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:10:51,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:10:51,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:10:51,241 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:10:51,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:10:51,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:10:51,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:10:51,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:10:51,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:10:51,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:10:51,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:10:51,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:10:51,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:10:51,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:10:51,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:10:51,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:10:51,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:10:51,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:10:51,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:10:51,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:10:51,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:10:51,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:10:51,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:10:51,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:10:51,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:10:51,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:10:51,301 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:10:51,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:10:51,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:10:51,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:10:51,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:10:51,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:10:51,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:10:51,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:10:51,304 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:10:51,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:10:51,305 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:10:51,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:10:51,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:10:51,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:10:51,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:10:51,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:10:51,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:10:51,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:10:51,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:10:51,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:10:51,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:10:51,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:10:51,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:10:51,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:10:51,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:10:51,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:10:51,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:10:51,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:10:51,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:10:51,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:10:51,309 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:10:51,310 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:10:51,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:10:51,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2022-07-13 15:10:51,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:10:51,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:10:51,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:10:51,592 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:10:51,593 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:10:51,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-13 15:10:51,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f35a8386/1bbcb3c35f9b4aecb65d6e778ddbe89a/FLAG423c0cbc7 [2022-07-13 15:10:52,168 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:10:52,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-13 15:10:52,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f35a8386/1bbcb3c35f9b4aecb65d6e778ddbe89a/FLAG423c0cbc7 [2022-07-13 15:10:52,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f35a8386/1bbcb3c35f9b4aecb65d6e778ddbe89a [2022-07-13 15:10:52,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:10:52,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:10:52,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:10:52,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:10:52,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:10:52,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:10:52" (1/1) ... [2022-07-13 15:10:52,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360ad7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:52, skipping insertion in model container [2022-07-13 15:10:52,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:10:52" (1/1) ... [2022-07-13 15:10:52,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:10:52,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:10:53,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-13 15:10:53,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-13 15:10:53,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-13 15:10:53,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:10:53,059 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:10:53,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-13 15:10:53,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-13 15:10:53,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-13 15:10:53,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:10:53,148 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:10:53,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53 WrapperNode [2022-07-13 15:10:53,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:10:53,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:10:53,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:10:53,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:10:53,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,225 INFO L137 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 129 [2022-07-13 15:10:53,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:10:53,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:10:53,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:10:53,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:10:53,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:10:53,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:10:53,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:10:53,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:10:53,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (1/1) ... [2022-07-13 15:10:53,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:10:53,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:10:53,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:10:53,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:10:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-13 15:10:53,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-13 15:10:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-13 15:10:53,365 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-13 15:10:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:10:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-13 15:10:53,366 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-13 15:10:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:10:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:10:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-13 15:10:53,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-13 15:10:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:10:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:10:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:10:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:10:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-13 15:10:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-13 15:10:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:10:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:10:53,505 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:10:53,508 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:10:53,752 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:10:53,760 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:10:53,760 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 15:10:53,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:10:53 BoogieIcfgContainer [2022-07-13 15:10:53,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:10:53,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:10:53,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:10:53,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:10:53,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:10:52" (1/3) ... [2022-07-13 15:10:53,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b59da87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:10:53, skipping insertion in model container [2022-07-13 15:10:53,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:10:53" (2/3) ... [2022-07-13 15:10:53,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b59da87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:10:53, skipping insertion in model container [2022-07-13 15:10:53,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:10:53" (3/3) ... [2022-07-13 15:10:53,770 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2022-07-13 15:10:53,783 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:10:53,784 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-13 15:10:53,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:10:53,827 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@580eeda6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ced8a41 [2022-07-13 15:10:53,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-13 15:10:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 15:10:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 15:10:53,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:10:53,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:10:53,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:10:53,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:10:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2022-07-13 15:10:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:10:53,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754813763] [2022-07-13 15:10:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:10:53,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:10:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:10:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:10:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 15:10:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:10:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:10:54,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754813763] [2022-07-13 15:10:54,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754813763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:10:54,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:10:54,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:10:54,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920392185] [2022-07-13 15:10:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:10:54,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:10:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:10:54,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:10:54,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:10:54,131 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:10:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:10:54,240 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2022-07-13 15:10:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:10:54,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-13 15:10:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:10:54,254 INFO L225 Difference]: With dead ends: 147 [2022-07-13 15:10:54,254 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 15:10:54,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:10:54,259 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:10:54,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 99 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:10:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 15:10:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-07-13 15:10:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 15:10:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2022-07-13 15:10:54,296 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2022-07-13 15:10:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:10:54,296 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2022-07-13 15:10:54,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:10:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-07-13 15:10:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 15:10:54,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:10:54,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:10:54,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:10:54,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:10:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:10:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2022-07-13 15:10:54,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:10:54,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885158463] [2022-07-13 15:10:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:10:54,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:10:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:10:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:10:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 15:10:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:10:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:10:54,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885158463] [2022-07-13 15:10:54,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885158463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:10:54,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:10:54,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:10:54,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352112601] [2022-07-13 15:10:54,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:10:54,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:10:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:10:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:10:54,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:10:54,446 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:10:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:10:54,638 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-07-13 15:10:54,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:10:54,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-13 15:10:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:10:54,646 INFO L225 Difference]: With dead ends: 82 [2022-07-13 15:10:54,646 INFO L226 Difference]: Without dead ends: 80 [2022-07-13 15:10:54,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:10:54,649 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:10:54,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 166 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:10:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-13 15:10:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2022-07-13 15:10:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-13 15:10:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-07-13 15:10:54,672 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2022-07-13 15:10:54,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:10:54,673 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-07-13 15:10:54,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:10:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-07-13 15:10:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 15:10:54,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:10:54,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:10:54,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:10:54,674 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:10:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:10:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2022-07-13 15:10:54,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:10:54,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955664441] [2022-07-13 15:10:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:10:54,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:10:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:10:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:10:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 15:10:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:10:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:10:54,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955664441] [2022-07-13 15:10:54,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955664441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:10:54,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:10:54,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:10:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968157058] [2022-07-13 15:10:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:10:54,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:10:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:10:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:10:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:10:54,845 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:10:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:10:55,305 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2022-07-13 15:10:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:10:55,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-13 15:10:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:10:55,307 INFO L225 Difference]: With dead ends: 206 [2022-07-13 15:10:55,307 INFO L226 Difference]: Without dead ends: 145 [2022-07-13 15:10:55,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:10:55,309 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 136 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:10:55,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 202 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:10:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-13 15:10:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2022-07-13 15:10:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) [2022-07-13 15:10:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2022-07-13 15:10:55,325 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2022-07-13 15:10:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:10:55,325 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2022-07-13 15:10:55,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:10:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2022-07-13 15:10:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 15:10:55,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:10:55,328 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:10:55,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:10:55,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:10:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:10:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2022-07-13 15:10:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:10:55,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87995101] [2022-07-13 15:10:55,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:10:55,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:10:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:10:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:10:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:10:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 15:10:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:10:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 15:10:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 15:10:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:10:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 15:10:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-13 15:10:55,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:10:55,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87995101] [2022-07-13 15:10:55,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87995101] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:10:55,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161781726] [2022-07-13 15:10:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:10:55,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:10:55,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:10:55,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:10:55,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:10:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:55,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:10:55,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:10:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 15:10:55,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:10:55,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161781726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:10:55,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:10:55,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-13 15:10:55,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640491793] [2022-07-13 15:10:55,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:10:55,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:10:55,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:10:55,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:10:55,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:10:55,716 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 15:10:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:10:55,758 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2022-07-13 15:10:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:10:55,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-07-13 15:10:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:10:55,760 INFO L225 Difference]: With dead ends: 219 [2022-07-13 15:10:55,761 INFO L226 Difference]: Without dead ends: 126 [2022-07-13 15:10:55,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:10:55,762 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:10:55,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:10:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-13 15:10:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-13 15:10:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 96 states have internal predecessors, (107), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (30), 20 states have call predecessors, (30), 18 states have call successors, (30) [2022-07-13 15:10:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2022-07-13 15:10:55,786 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2022-07-13 15:10:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:10:55,786 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2022-07-13 15:10:55,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 15:10:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2022-07-13 15:10:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 15:10:55,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:10:55,789 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:10:55,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 15:10:56,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:10:56,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:10:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:10:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2022-07-13 15:10:56,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:10:56,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903026010] [2022-07-13 15:10:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:10:56,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:10:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:10:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:10:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:10:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 15:10:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:56,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:10:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:10:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:10:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 15:10:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 15:10:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:10:57,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903026010] [2022-07-13 15:10:57,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903026010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:10:57,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098189603] [2022-07-13 15:10:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:10:57,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:10:57,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:10:57,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:10:57,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:10:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:10:57,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 199 conjunts are in the unsatisfiable core [2022-07-13 15:10:57,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:10:57,780 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:10:57,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 15:10:58,020 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-13 15:10:58,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-13 15:10:58,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:10:58,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:10:59,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:10:59,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:10:59,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:10:59,742 INFO L356 Elim1Store]: treesize reduction 168, result has 22.9 percent of original size [2022-07-13 15:10:59,743 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:10:59,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:10:59,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:10:59,944 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) 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:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) 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:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:10:59,948 INFO L158 Benchmark]: Toolchain (without parser) took 7280.96ms. Allocated memory was 102.8MB in the beginning and 157.3MB in the end (delta: 54.5MB). Free memory was 71.4MB in the beginning and 108.8MB in the end (delta: -37.4MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-07-13 15:10:59,948 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 102.8MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:10:59,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.78ms. Allocated memory is still 102.8MB. Free memory was 71.1MB in the beginning and 67.2MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:10:59,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.88ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 64.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:10:59,949 INFO L158 Benchmark]: Boogie Preprocessor took 69.93ms. Allocated memory is still 102.8MB. Free memory was 64.5MB in the beginning and 62.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:10:59,949 INFO L158 Benchmark]: RCFGBuilder took 464.48ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 62.8MB in the beginning and 103.2MB in the end (delta: -40.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-07-13 15:10:59,949 INFO L158 Benchmark]: TraceAbstraction took 6183.22ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 102.5MB in the beginning and 108.8MB in the end (delta: -6.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-07-13 15:10:59,951 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.22ms. Allocated memory is still 102.8MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.78ms. Allocated memory is still 102.8MB. Free memory was 71.1MB in the beginning and 67.2MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.88ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 64.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.93ms. Allocated memory is still 102.8MB. Free memory was 64.5MB in the beginning and 62.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 464.48ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 62.8MB in the beginning and 103.2MB in the end (delta: -40.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6183.22ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 102.5MB in the beginning and 108.8MB in the end (delta: -6.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:10:59,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:11:01,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:11:01,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:11:01,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:11:01,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:11:01,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:11:01,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:11:01,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:11:01,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:11:02,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:11:02,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:11:02,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:11:02,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:11:02,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:11:02,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:11:02,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:11:02,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:11:02,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:11:02,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:11:02,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:11:02,035 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:11:02,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:11:02,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:11:02,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:11:02,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:11:02,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:11:02,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:11:02,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:11:02,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:11:02,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:11:02,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:11:02,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:11:02,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:11:02,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:11:02,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:11:02,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:11:02,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:11:02,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:11:02,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:11:02,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:11:02,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:11:02,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:11:02,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 15:11:02,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:11:02,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:11:02,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:11:02,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:11:02,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:11:02,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:11:02,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:11:02,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:11:02,103 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:11:02,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:11:02,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:11:02,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:11:02,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:11:02,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:11:02,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:11:02,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:11:02,105 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:11:02,106 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:11:02,106 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:11:02,106 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:11:02,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:11:02,107 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:11:02,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:11:02,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:11:02,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:11:02,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:11:02,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:11:02,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:11:02,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:11:02,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:11:02,109 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:11:02,109 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:11:02,109 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:11:02,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:11:02,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:11:02,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:11:02,110 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2022-07-13 15:11:02,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:11:02,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:11:02,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:11:02,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:11:02,466 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:11:02,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-13 15:11:02,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e26e4d3/e6ea301f41e04e16a042131387df30c9/FLAG34cceacd5 [2022-07-13 15:11:02,974 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:11:02,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-13 15:11:03,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e26e4d3/e6ea301f41e04e16a042131387df30c9/FLAG34cceacd5 [2022-07-13 15:11:03,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e26e4d3/e6ea301f41e04e16a042131387df30c9 [2022-07-13 15:11:03,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:11:03,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:11:03,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:11:03,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:11:03,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:11:03,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:03,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421b0432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03, skipping insertion in model container [2022-07-13 15:11:03,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:03,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:11:03,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:11:03,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-13 15:11:03,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-13 15:11:03,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-13 15:11:03,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:11:03,776 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 15:11:03,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:11:03,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-13 15:11:03,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-13 15:11:03,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-13 15:11:03,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:11:03,849 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:11:03,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-13 15:11:03,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-13 15:11:03,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-13 15:11:03,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:11:03,944 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:11:03,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03 WrapperNode [2022-07-13 15:11:03,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:11:03,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:11:03,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:11:03,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:11:03,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:03,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:04,018 INFO L137 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 125 [2022-07-13 15:11:04,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:11:04,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:11:04,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:11:04,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:11:04,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:04,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:04,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:04,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:04,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:04,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:04,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:04,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:11:04,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:11:04,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:11:04,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:11:04,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (1/1) ... [2022-07-13 15:11:04,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:11:04,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:11:04,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:11:04,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:11:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-13 15:11:04,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-13 15:11:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-13 15:11:04,159 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-13 15:11:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:11:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-13 15:11:04,159 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-13 15:11:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:11:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:11:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-13 15:11:04,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-13 15:11:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:11:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:11:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:11:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:11:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-13 15:11:04,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-13 15:11:04,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:11:04,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:11:04,324 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:11:04,341 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:11:04,628 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:11:04,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:11:04,634 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 15:11:04,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:04 BoogieIcfgContainer [2022-07-13 15:11:04,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:11:04,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:11:04,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:11:04,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:11:04,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:11:03" (1/3) ... [2022-07-13 15:11:04,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b2e6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:11:04, skipping insertion in model container [2022-07-13 15:11:04,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:03" (2/3) ... [2022-07-13 15:11:04,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b2e6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:11:04, skipping insertion in model container [2022-07-13 15:11:04,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:04" (3/3) ... [2022-07-13 15:11:04,643 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2022-07-13 15:11:04,656 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:11:04,657 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-13 15:11:04,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:11:04,717 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4aed7db7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@51d97869 [2022-07-13 15:11:04,717 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-13 15:11:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 15:11:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:11:04,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:04,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:04,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2022-07-13 15:11:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:04,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058141021] [2022-07-13 15:11:04,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:04,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:04,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:04,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:11:04,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 15:11:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:04,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 15:11:04,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:11:04,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:11:04,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:04,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058141021] [2022-07-13 15:11:04,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058141021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:04,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:04,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:11:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518217334] [2022-07-13 15:11:04,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:04,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:11:04,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:11:04,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:11:04,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:11:04,984 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:11:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:05,038 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-07-13 15:11:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:11:05,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-07-13 15:11:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:05,046 INFO L225 Difference]: With dead ends: 130 [2022-07-13 15:11:05,047 INFO L226 Difference]: Without dead ends: 62 [2022-07-13 15:11:05,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:11:05,054 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:05,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:11:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-13 15:11:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-13 15:11:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 15:11:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-13 15:11:05,090 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2022-07-13 15:11:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:05,092 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-13 15:11:05,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:11:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-13 15:11:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:11:05,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:05,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:05,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 15:11:05,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:11:05,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2022-07-13 15:11:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:05,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902317072] [2022-07-13 15:11:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:05,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:05,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:05,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:11:05,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 15:11:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:05,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 15:11:05,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:11:05,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:11:05,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:05,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902317072] [2022-07-13 15:11:05,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902317072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:05,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:05,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:11:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900639514] [2022-07-13 15:11:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:05,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:11:05,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:11:05,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:11:05,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:11:05,823 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:11:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:06,198 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-07-13 15:11:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:11:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-13 15:11:06,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:06,202 INFO L225 Difference]: With dead ends: 170 [2022-07-13 15:11:06,202 INFO L226 Difference]: Without dead ends: 116 [2022-07-13 15:11:06,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:11:06,204 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:06,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 184 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:11:06,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-13 15:11:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2022-07-13 15:11:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (23), 17 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-13 15:11:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2022-07-13 15:11:06,221 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2022-07-13 15:11:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:06,222 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2022-07-13 15:11:06,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:11:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-07-13 15:11:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:11:06,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:06,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:06,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:11:06,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:11:06,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2022-07-13 15:11:06,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:06,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078177794] [2022-07-13 15:11:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:06,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:11:06,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 15:11:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:06,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:11:06,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:11:06,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:11:06,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078177794] [2022-07-13 15:11:06,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078177794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:06,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:11:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879659946] [2022-07-13 15:11:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:06,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:11:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:11:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:11:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:11:06,544 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:11:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:06,564 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2022-07-13 15:11:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:11:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-13 15:11:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:06,566 INFO L225 Difference]: With dead ends: 108 [2022-07-13 15:11:06,566 INFO L226 Difference]: Without dead ends: 106 [2022-07-13 15:11:06,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:11:06,568 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:06,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:11:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-13 15:11:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-07-13 15:11:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2022-07-13 15:11:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-07-13 15:11:06,580 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2022-07-13 15:11:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:06,581 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-07-13 15:11:06,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:11:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-07-13 15:11:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 15:11:06,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:06,583 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:06,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:11:06,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:11:06,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:06,795 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2022-07-13 15:11:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:06,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690326405] [2022-07-13 15:11:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:06,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:06,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:06,797 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:11:06,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 15:11:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:06,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 15:11:06,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:07,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:11:07,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:11:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 15:11:07,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:11:07,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:07,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690326405] [2022-07-13 15:11:07,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690326405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:07,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:07,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 15:11:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459919741] [2022-07-13 15:11:07,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:07,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 15:11:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:11:07,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 15:11:07,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:11:07,397 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 15:11:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:08,922 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2022-07-13 15:11:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 15:11:08,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 67 [2022-07-13 15:11:08,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:08,925 INFO L225 Difference]: With dead ends: 268 [2022-07-13 15:11:08,926 INFO L226 Difference]: Without dead ends: 162 [2022-07-13 15:11:08,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-07-13 15:11:08,928 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 241 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:08,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 312 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 15:11:08,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-13 15:11:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2022-07-13 15:11:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 19 states have call successors, (19), 10 states have call predecessors, (19), 14 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2022-07-13 15:11:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-07-13 15:11:08,954 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2022-07-13 15:11:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:08,959 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-07-13 15:11:08,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 15:11:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-07-13 15:11:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 15:11:08,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:08,962 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:08,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:11:09,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:11:09,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2022-07-13 15:11:09,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:09,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800640738] [2022-07-13 15:11:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:09,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:09,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:09,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:11:09,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 15:11:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:09,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:11:09,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 15:11:09,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:11:09,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:09,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800640738] [2022-07-13 15:11:09,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800640738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:09,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:09,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:11:09,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254940675] [2022-07-13 15:11:09,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:09,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:11:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:11:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:11:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:11:09,304 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 15:11:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:09,329 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2022-07-13 15:11:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:11:09,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2022-07-13 15:11:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:09,335 INFO L225 Difference]: With dead ends: 196 [2022-07-13 15:11:09,335 INFO L226 Difference]: Without dead ends: 109 [2022-07-13 15:11:09,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:11:09,338 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:09,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:11:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-13 15:11:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-07-13 15:11:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-13 15:11:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-07-13 15:11:09,360 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2022-07-13 15:11:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:09,360 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-07-13 15:11:09,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 15:11:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-07-13 15:11:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 15:11:09,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:09,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:09,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:11:09,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:11:09,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2022-07-13 15:11:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:09,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111752656] [2022-07-13 15:11:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:09,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:09,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:09,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:11:09,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 15:11:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:09,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-13 15:11:09,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:09,992 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:11:09,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-13 15:11:10,158 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-13 15:11:10,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 15:11:10,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:11:10,943 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-13 15:11:10,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-13 15:11:10,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:11:11,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:11:11,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:11:14,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:11:14,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:11:14,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 20 [2022-07-13 15:11:14,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:11:14,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:11:14,473 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-07-13 15:11:14,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 127 [2022-07-13 15:11:14,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:11:14,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:11:14,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:11:14,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:11:14,549 INFO L356 Elim1Store]: treesize reduction 28, result has 12.5 percent of original size [2022-07-13 15:11:14,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 404 treesize of output 295 [2022-07-13 15:11:14,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:11:14,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:11:14,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:14,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:14,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:11:14,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:11:14,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 25 [2022-07-13 15:11:15,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-13 15:11:16,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-13 15:11:17,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-13 15:11:18,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-13 15:11:19,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-13 15:11:20,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:11:26,610 WARN L233 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 66 DAG size of output: 38 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-13 15:11:26,611 INFO L356 Elim1Store]: treesize reduction 144, result has 32.1 percent of original size [2022-07-13 15:11:26,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:26,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111752656] [2022-07-13 15:11:26,612 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:11:26,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-13 15:11:26,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:11:26,813 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_7| input size 184 context size 184 output size 184 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) 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:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) 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:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:11:26,816 INFO L158 Benchmark]: Toolchain (without parser) took 23488.82ms. Allocated memory was 50.3MB in the beginning and 111.1MB in the end (delta: 60.8MB). Free memory was 24.9MB in the beginning and 74.4MB in the end (delta: -49.5MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2022-07-13 15:11:26,817 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 50.3MB. Free memory was 31.7MB in the beginning and 31.7MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:11:26,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.10ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 35.5MB in the beginning and 31.6MB in the end (delta: 3.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 15:11:26,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.91ms. Allocated memory is still 62.9MB. Free memory was 31.6MB in the beginning and 44.8MB in the end (delta: -13.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-07-13 15:11:26,817 INFO L158 Benchmark]: Boogie Preprocessor took 63.10ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 42.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:11:26,818 INFO L158 Benchmark]: RCFGBuilder took 552.25ms. Allocated memory is still 62.9MB. Free memory was 42.6MB in the beginning and 43.7MB in the end (delta: -1.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 15:11:26,818 INFO L158 Benchmark]: TraceAbstraction took 22177.78ms. Allocated memory was 62.9MB in the beginning and 111.1MB in the end (delta: 48.2MB). Free memory was 43.4MB in the beginning and 74.4MB in the end (delta: -31.0MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-07-13 15:11:26,819 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.23ms. Allocated memory is still 50.3MB. Free memory was 31.7MB in the beginning and 31.7MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.10ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 35.5MB in the beginning and 31.6MB in the end (delta: 3.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.91ms. Allocated memory is still 62.9MB. Free memory was 31.6MB in the beginning and 44.8MB in the end (delta: -13.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.10ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 42.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.25ms. Allocated memory is still 62.9MB. Free memory was 42.6MB in the beginning and 43.7MB in the end (delta: -1.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22177.78ms. Allocated memory was 62.9MB in the beginning and 111.1MB in the end (delta: 48.2MB). Free memory was 43.4MB in the beginning and 74.4MB in the end (delta: -31.0MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_7| input size 184 context size 184 output size 184 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_7| input size 184 context size 184 output size 184: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:11:26,856 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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_7| input size 184 context size 184 output size 184