./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_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-?-6c24879 [2022-07-12 03:26:58,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:26:58,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:26:58,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:26:58,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:26:58,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:26:58,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:26:58,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:26:58,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:26:58,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:26:58,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:26:58,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:26:58,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:26:58,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:26:58,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:26:58,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:26:58,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:26:58,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:26:58,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:26:58,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:26:58,426 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:26:58,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:26:58,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:26:58,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:26:58,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:26:58,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:26:58,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:26:58,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:26:58,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:26:58,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:26:58,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:26:58,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:26:58,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:26:58,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:26:58,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:26:58,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:26:58,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:26:58,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:26:58,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:26:58,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:26:58,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:26:58,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:26:58,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:26:58,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:26:58,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:26:58,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:26:58,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:26:58,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:26:58,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:26:58,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:26:58,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:26:58,470 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:26:58,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:26:58,471 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:26:58,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:26:58,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:26:58,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:26:58,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:26:58,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:26:58,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:26:58,472 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:26:58,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:26:58,472 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:26:58,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:26:58,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:26:58,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:26:58,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:26:58,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:26:58,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:26:58,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:26:58,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:26:58,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:26:58,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:26:58,474 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:26:58,474 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:26:58,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:26:58,475 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-12 03:26:58,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:26:58,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:26:58,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:26:58,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:26:58,711 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:26:58,713 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-12 03:26:58,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59182a5bf/456cd513d8f342fcb0b44c933aaea082/FLAG7770d4281 [2022-07-12 03:26:59,278 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:26:59,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-12 03:26:59,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59182a5bf/456cd513d8f342fcb0b44c933aaea082/FLAG7770d4281 [2022-07-12 03:26:59,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59182a5bf/456cd513d8f342fcb0b44c933aaea082 [2022-07-12 03:26:59,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:26:59,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:26:59,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:59,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:26:59,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:26:59,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:26:59,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4585bbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59, skipping insertion in model container [2022-07-12 03:26:59,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:26:59,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:26:59,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:26:59,853 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-12 03:26:59,856 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-12 03:26:59,859 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-12 03:26:59,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:59,868 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:26:59,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[25842,25855] [2022-07-12 03:26:59,915 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-12 03:26:59,916 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-12 03:26:59,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:26:59,944 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:26:59,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59 WrapperNode [2022-07-12 03:26:59,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:26:59,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:59,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:26:59,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:26:59,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:26:59,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:26:59,992 INFO L137 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 129 [2022-07-12 03:26:59,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:26:59,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:26:59,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:26:59,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:26:59,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:26:59,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:27:00,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:27:00,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:27:00,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:27:00,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:27:00,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:27:00,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:27:00,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:27:00,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:27:00,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:27:00,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (1/1) ... [2022-07-12 03:27:00,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:27:00,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:27:00,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:27:00,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:27:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-12 03:27:00,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-12 03:27:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 03:27:00,073 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 03:27:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:27:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-12 03:27:00,074 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-12 03:27:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:27:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:27:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-12 03:27:00,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-12 03:27:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:27:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:27:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:27:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:27:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-12 03:27:00,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-12 03:27:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:27:00,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:27:00,190 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:27:00,191 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:27:00,368 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:27:00,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:27:00,372 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:27:00,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:27:00 BoogieIcfgContainer [2022-07-12 03:27:00,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:27:00,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:27:00,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:27:00,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:27:00,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:26:59" (1/3) ... [2022-07-12 03:27:00,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1ed5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:27:00, skipping insertion in model container [2022-07-12 03:27:00,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:26:59" (2/3) ... [2022-07-12 03:27:00,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1ed5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:27:00, skipping insertion in model container [2022-07-12 03:27:00,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:27:00" (3/3) ... [2022-07-12 03:27:00,380 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2022-07-12 03:27:00,389 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:27:00,390 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-12 03:27:00,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:27:00,446 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@586e9ea4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c1bc358 [2022-07-12 03:27:00,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 03:27:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 03:27:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:27:00,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:00,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:00,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:00,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2022-07-12 03:27:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:00,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908485739] [2022-07-12 03:27:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:00,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:27:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:00,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:27:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:27:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:27:00,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:00,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908485739] [2022-07-12 03:27:00,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908485739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:00,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:00,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:27:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572355524] [2022-07-12 03:27:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:00,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:27:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:27:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:27:00,659 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:27:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:00,755 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2022-07-12 03:27:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:27:00,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-12 03:27:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:00,768 INFO L225 Difference]: With dead ends: 147 [2022-07-12 03:27:00,768 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 03:27:00,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:27:00,777 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-12 03:27:00,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 99 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:27:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 03:27:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-07-12 03:27:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 03:27:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2022-07-12 03:27:00,824 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2022-07-12 03:27:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:00,824 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2022-07-12 03:27:00,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:27:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-07-12 03:27:00,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:27:00,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:00,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:00,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:27:00,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2022-07-12 03:27:00,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:00,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541013516] [2022-07-12 03:27:00,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:00,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:27:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:00,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:27:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:00,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:27:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:27:00,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:00,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541013516] [2022-07-12 03:27:00,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541013516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:00,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:00,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:27:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741899616] [2022-07-12 03:27:00,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:00,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:27:00,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:00,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:27:00,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:27:00,998 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:27:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:01,162 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-07-12 03:27:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:27:01,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-12 03:27:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:01,164 INFO L225 Difference]: With dead ends: 82 [2022-07-12 03:27:01,164 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 03:27:01,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:27:01,165 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:01,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 166 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:27:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 03:27:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2022-07-12 03:27:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-12 03:27:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-07-12 03:27:01,173 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2022-07-12 03:27:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:01,173 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-07-12 03:27:01,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:27:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-07-12 03:27:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:27:01,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:01,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:01,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:27:01,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2022-07-12 03:27:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:01,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907204304] [2022-07-12 03:27:01,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:01,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:27:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:27:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:27:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:27:01,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:01,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907204304] [2022-07-12 03:27:01,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907204304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:01,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:01,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:27:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296774162] [2022-07-12 03:27:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:01,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:27:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:01,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:27:01,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:27:01,279 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:27:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:01,620 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2022-07-12 03:27:01,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:27:01,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-12 03:27:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:01,622 INFO L225 Difference]: With dead ends: 206 [2022-07-12 03:27:01,622 INFO L226 Difference]: Without dead ends: 145 [2022-07-12 03:27:01,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:27:01,623 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 136 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:01,624 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.2s Time] [2022-07-12 03:27:01,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-12 03:27:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2022-07-12 03:27:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) [2022-07-12 03:27:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2022-07-12 03:27:01,655 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2022-07-12 03:27:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:01,655 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2022-07-12 03:27:01,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:27:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2022-07-12 03:27:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 03:27:01,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:01,657 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:01,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:27:01,657 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:01,658 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2022-07-12 03:27:01,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:01,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284424943] [2022-07-12 03:27:01,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:27:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:27:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 03:27:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 03:27:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:27:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 03:27:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 03:27:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:27:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 03:27:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 03:27:01,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:01,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284424943] [2022-07-12 03:27:01,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284424943] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:27:01,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739671071] [2022-07-12 03:27:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:01,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:01,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:27:01,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:27:01,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:27:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:01,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:27:01,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 03:27:01,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:27:01,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739671071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:01,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:27:01,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-12 03:27:01,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361408655] [2022-07-12 03:27:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:01,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:27:01,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:01,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:27:01,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:27:01,953 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 03:27:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:01,967 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2022-07-12 03:27:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:27:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-07-12 03:27:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:01,968 INFO L225 Difference]: With dead ends: 219 [2022-07-12 03:27:01,969 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 03:27:01,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:27:01,970 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:01,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:27:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 03:27:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-12 03:27:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 96 states have internal predecessors, (107), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (30), 20 states have call predecessors, (30), 18 states have call successors, (30) [2022-07-12 03:27:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2022-07-12 03:27:01,979 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2022-07-12 03:27:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:01,979 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2022-07-12 03:27:01,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 03:27:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2022-07-12 03:27:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 03:27:01,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:01,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:02,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:27:02,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:02,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:02,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:02,204 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2022-07-12 03:27:02,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:02,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593819537] [2022-07-12 03:27:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:02,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:02,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:27:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:02,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:27:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:02,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 03:27:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:02,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 03:27:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:27:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:02,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 03:27:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 03:27:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 03:27:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:27:03,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:03,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593819537] [2022-07-12 03:27:03,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593819537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:27:03,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653374043] [2022-07-12 03:27:03,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:03,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:03,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:27:03,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:27:03,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:27:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:03,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 199 conjunts are in the unsatisfiable core [2022-07-12 03:27:03,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:03,474 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:27:03,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:27:03,648 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 03:27:03,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 03:27:03,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:27:03,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:27:05,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:05,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:05,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:05,376 INFO L356 Elim1Store]: treesize reduction 168, result has 22.9 percent of original size [2022-07-12 03:27:05,377 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:27:05,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 03:27:05,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:05,578 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 03:27:05,581 INFO L158 Benchmark]: Toolchain (without parser) took 6003.52ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 45.5MB in the beginning and 73.2MB in the end (delta: -27.7MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-07-12 03:27:05,581 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:27:05,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.40ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 45.3MB in the beginning and 63.9MB in the end (delta: -18.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 03:27:05,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.01ms. Allocated memory is still 98.6MB. Free memory was 63.9MB in the beginning and 61.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:27:05,582 INFO L158 Benchmark]: Boogie Preprocessor took 27.76ms. Allocated memory is still 98.6MB. Free memory was 61.8MB in the beginning and 59.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:27:05,582 INFO L158 Benchmark]: RCFGBuilder took 352.51ms. Allocated memory is still 98.6MB. Free memory was 59.7MB in the beginning and 42.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 03:27:05,582 INFO L158 Benchmark]: TraceAbstraction took 5205.28ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 41.7MB in the beginning and 73.2MB in the end (delta: -31.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2022-07-12 03:27:05,592 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.16ms. Allocated memory is still 81.8MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.40ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 45.3MB in the beginning and 63.9MB in the end (delta: -18.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.01ms. Allocated memory is still 98.6MB. Free memory was 63.9MB in the beginning and 61.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.76ms. Allocated memory is still 98.6MB. Free memory was 61.8MB in the beginning and 59.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.51ms. Allocated memory is still 98.6MB. Free memory was 59.7MB in the beginning and 42.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5205.28ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 41.7MB in the beginning and 73.2MB in the end (delta: -31.5MB). Peak memory consumption was 16.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_4| input size 75 context size 75 output size 75 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 03:27:05,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:27:07,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:27:07,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:27:07,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:27:07,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:27:07,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:27:07,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:27:07,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:27:07,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:27:07,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:27:07,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:27:07,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:27:07,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:27:07,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:27:07,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:27:07,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:27:07,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:27:07,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:27:07,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:27:07,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:27:07,563 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:27:07,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:27:07,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:27:07,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:27:07,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:27:07,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:27:07,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:27:07,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:27:07,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:27:07,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:27:07,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:27:07,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:27:07,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:27:07,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:27:07,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:27:07,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:27:07,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:27:07,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:27:07,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:27:07,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:27:07,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:27:07,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:27:07,586 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:27:07,615 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:27:07,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:27:07,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:27:07,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:27:07,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:27:07,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:27:07,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:27:07,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:27:07,633 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:27:07,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:27:07,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:27:07,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:27:07,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:27:07,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:27:07,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:27:07,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:27:07,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:27:07,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:27:07,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:27:07,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:27:07,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:27:07,635 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:27:07,635 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:27:07,636 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:27:07,636 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:27:07,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:27:07,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:27:07,636 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-12 03:27:07,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:27:07,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:27:07,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:27:07,939 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:27:07,939 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:27:07,941 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-12 03:27:07,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da29670a1/e906e207c0c54deca1f6621e315bfe10/FLAG9a8e976c5 [2022-07-12 03:27:08,409 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:27:08,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-12 03:27:08,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da29670a1/e906e207c0c54deca1f6621e315bfe10/FLAG9a8e976c5 [2022-07-12 03:27:08,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da29670a1/e906e207c0c54deca1f6621e315bfe10 [2022-07-12 03:27:08,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:27:08,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:27:08,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:27:08,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:27:08,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:27:08,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:08,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cbc9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08, skipping insertion in model container [2022-07-12 03:27:08,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:08,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:27:08,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:27:08,748 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-12 03:27:08,754 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-12 03:27:08,757 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-12 03:27:08,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:27:08,775 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 03:27:08,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:27:08,829 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-12 03:27:08,831 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-12 03:27:08,832 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-12 03:27:08,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:27:08,838 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:27:08,870 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-12 03:27:08,873 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-12 03:27:08,874 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-12 03:27:08,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:27:08,903 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:27:08,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08 WrapperNode [2022-07-12 03:27:08,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:27:08,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:27:08,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:27:08,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:27:08,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:08,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:08,959 INFO L137 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 125 [2022-07-12 03:27:08,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:27:08,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:27:08,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:27:08,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:27:08,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:08,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:08,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:08,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:09,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:09,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:09,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:09,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:27:09,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:27:09,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:27:09,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:27:09,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (1/1) ... [2022-07-12 03:27:09,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:27:09,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:27:09,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:27:09,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:27:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-12 03:27:09,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-12 03:27:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 03:27:09,077 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 03:27:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:27:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-12 03:27:09,077 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-12 03:27:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:27:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:27:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-12 03:27:09,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-12 03:27:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:27:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:27:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:27:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:27:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-12 03:27:09,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-12 03:27:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:27:09,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:27:09,190 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:27:09,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:27:09,492 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:27:09,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:27:09,497 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:27:09,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:27:09 BoogieIcfgContainer [2022-07-12 03:27:09,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:27:09,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:27:09,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:27:09,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:27:09,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:27:08" (1/3) ... [2022-07-12 03:27:09,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd826e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:27:09, skipping insertion in model container [2022-07-12 03:27:09,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:27:08" (2/3) ... [2022-07-12 03:27:09,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd826e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:27:09, skipping insertion in model container [2022-07-12 03:27:09,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:27:09" (3/3) ... [2022-07-12 03:27:09,519 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2022-07-12 03:27:09,528 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:27:09,528 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-12 03:27:09,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:27:09,577 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@4d303ba6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@364b7174 [2022-07-12 03:27:09,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 03:27:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 03:27:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:27:09,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:09,588 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:09,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2022-07-12 03:27:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:27:09,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044223359] [2022-07-12 03:27:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:09,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:27:09,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:27:09,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:27:09,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:27:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:09,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:27:09,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:27:09,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:27:09,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:27:09,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044223359] [2022-07-12 03:27:09,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044223359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:09,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:09,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:27:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688344065] [2022-07-12 03:27:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:09,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:27:09,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:27:09,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:27:09,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:27:09,801 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:27:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:09,833 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-07-12 03:27:09,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:27:09,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-07-12 03:27:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:09,841 INFO L225 Difference]: With dead ends: 130 [2022-07-12 03:27:09,843 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 03:27:09,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:27:09,852 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:09,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:27:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 03:27:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 03:27:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 03:27:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-12 03:27:09,884 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2022-07-12 03:27:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:09,885 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-12 03:27:09,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:27:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-12 03:27:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:27:09,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:09,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:09,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:27:10,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:27:10,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:10,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2022-07-12 03:27:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:27:10,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973112161] [2022-07-12 03:27:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:10,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:27:10,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:27:10,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:27:10,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:27:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:10,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 03:27:10,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:27:10,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:27:10,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:27:10,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973112161] [2022-07-12 03:27:10,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973112161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:10,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:10,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:27:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737179420] [2022-07-12 03:27:10,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:10,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:27:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:27:10,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:27:10,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:27:10,612 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:27:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:10,889 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-07-12 03:27:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:27:10,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-12 03:27:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:10,892 INFO L225 Difference]: With dead ends: 170 [2022-07-12 03:27:10,892 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 03:27:10,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:27:10,894 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:10,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 184 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:27:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 03:27:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2022-07-12 03:27:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (23), 17 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-12 03:27:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2022-07-12 03:27:10,908 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2022-07-12 03:27:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:10,908 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2022-07-12 03:27:10,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:27:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-07-12 03:27:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:27:10,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:10,909 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:10,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:27:11,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:27:11,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:11,119 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2022-07-12 03:27:11,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:27:11,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652140691] [2022-07-12 03:27:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:11,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:27:11,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:27:11,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:27:11,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:27:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:11,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:27:11,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:27:11,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:27:11,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:27:11,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652140691] [2022-07-12 03:27:11,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652140691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:11,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:11,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:27:11,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276569848] [2022-07-12 03:27:11,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:11,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:27:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:27:11,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:27:11,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:27:11,213 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:27:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:11,227 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2022-07-12 03:27:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:27:11,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-12 03:27:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:11,229 INFO L225 Difference]: With dead ends: 108 [2022-07-12 03:27:11,229 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 03:27:11,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:27:11,230 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:11,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:27:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 03:27:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-07-12 03:27:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2022-07-12 03:27:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-07-12 03:27:11,239 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2022-07-12 03:27:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:11,239 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-07-12 03:27:11,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:27:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-07-12 03:27:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 03:27:11,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:11,241 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:11,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:27:11,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:27:11,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:11,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2022-07-12 03:27:11,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:27:11,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606262009] [2022-07-12 03:27:11,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:11,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:27:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:27:11,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:27:11,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:27:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:11,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 03:27:11,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:11,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:27:11,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:27:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 03:27:11,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:27:11,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:27:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606262009] [2022-07-12 03:27:11,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606262009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:11,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:11,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:27:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512457238] [2022-07-12 03:27:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:11,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:27:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:27:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:27:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:27:11,936 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 03:27:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:13,132 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2022-07-12 03:27:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 03:27:13,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 67 [2022-07-12 03:27:13,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:13,135 INFO L225 Difference]: With dead ends: 268 [2022-07-12 03:27:13,135 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 03:27:13,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-07-12 03:27:13,137 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 241 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:13,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 311 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 03:27:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 03:27:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2022-07-12 03:27:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 19 states have call successors, (19), 10 states have call predecessors, (19), 14 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2022-07-12 03:27:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-07-12 03:27:13,177 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2022-07-12 03:27:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:13,177 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-07-12 03:27:13,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 03:27:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-07-12 03:27:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 03:27:13,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:13,185 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:13,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 03:27:13,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:27:13,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2022-07-12 03:27:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:27:13,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763155845] [2022-07-12 03:27:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:13,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:27:13,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:27:13,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:27:13,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:27:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:13,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:27:13,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 03:27:13,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:27:13,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:27:13,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763155845] [2022-07-12 03:27:13,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763155845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:13,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:13,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:27:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656746635] [2022-07-12 03:27:13,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:13,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:27:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:27:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:27:13,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:27:13,523 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 03:27:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:13,538 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2022-07-12 03:27:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:27:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2022-07-12 03:27:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:13,540 INFO L225 Difference]: With dead ends: 196 [2022-07-12 03:27:13,540 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 03:27:13,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:27:13,541 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:13,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:27:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 03:27:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-07-12 03:27:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-12 03:27:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-07-12 03:27:13,550 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2022-07-12 03:27:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:13,550 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-07-12 03:27:13,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 03:27:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-07-12 03:27:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 03:27:13,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:13,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:13,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 03:27:13,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:27:13,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:27:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2022-07-12 03:27:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:27:13,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514214984] [2022-07-12 03:27:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:13,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:27:13,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:27:13,765 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:27:13,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:27:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:14,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-12 03:27:14,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:14,137 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:27:14,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 03:27:14,287 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 03:27:14,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:27:14,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:27:15,094 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-12 03:27:15,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-12 03:27:15,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:27:15,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:27:15,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:27:15,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:15,834 INFO L356 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2022-07-12 03:27:15,834 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 153 treesize of output 100 [2022-07-12 03:27:15,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:15,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:15,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:15,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:15,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:15,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:15,951 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 87 treesize of output 44 [2022-07-12 03:27:15,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:15,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:16,761 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-12 03:27:25,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:29:21,617 WARN L233 SmtUtils]: Spent 1.93m on a formula simplification. DAG size of input: 101 DAG size of output: 32 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-12 03:29:21,619 INFO L356 Elim1Store]: treesize reduction 280, result has 15.9 percent of original size [2022-07-12 03:29:21,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 7 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 10 new quantified variables, introduced 17 case distinctions, treesize of input 912 treesize of output 1061 [2022-07-12 03:29:22,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:29:22,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:29:22,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:29:22,953 INFO L244 Elim1Store]: Index analysis took 104 ms [2022-07-12 03:29:22,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:29:22,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514214984] [2022-07-12 03:29:22,965 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:29:22,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:29:23,165 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-12 03:29:23,166 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraintForOnePosition(ArrayIndexEqualityManager.java:415) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraint(ArrayIndexEqualityManager.java:449) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.constructWriteConstraints2(Elim1Store.java:995) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:314) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.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-12 03:29:23,169 INFO L158 Benchmark]: Toolchain (without parser) took 134724.98ms. Allocated memory was 54.5MB in the beginning and 98.6MB in the end (delta: 44.0MB). Free memory was 32.0MB in the beginning and 36.7MB in the end (delta: -4.7MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2022-07-12 03:29:23,169 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 36.2MB in the beginning and 36.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:29:23,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.72ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.7MB in the beginning and 35.2MB in the end (delta: -3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:29:23,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.25ms. Allocated memory is still 67.1MB. Free memory was 35.2MB in the beginning and 32.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:29:23,170 INFO L158 Benchmark]: Boogie Preprocessor took 60.74ms. Allocated memory is still 67.1MB. Free memory was 32.6MB in the beginning and 48.5MB in the end (delta: -15.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-07-12 03:29:23,170 INFO L158 Benchmark]: RCFGBuilder took 476.65ms. Allocated memory is still 67.1MB. Free memory was 48.5MB in the beginning and 47.3MB in the end (delta: 1.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-07-12 03:29:23,173 INFO L158 Benchmark]: TraceAbstraction took 133669.20ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 47.0MB in the beginning and 36.7MB in the end (delta: 10.3MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2022-07-12 03:29:23,174 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 36.2MB in the beginning and 36.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.72ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.7MB in the beginning and 35.2MB in the end (delta: -3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.25ms. Allocated memory is still 67.1MB. Free memory was 35.2MB in the beginning and 32.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.74ms. Allocated memory is still 67.1MB. Free memory was 32.6MB in the beginning and 48.5MB in the end (delta: -15.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 476.65ms. Allocated memory is still 67.1MB. Free memory was 48.5MB in the beginning and 47.3MB in the end (delta: 1.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 133669.20ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 47.0MB in the beginning and 36.7MB in the end (delta: 10.3MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 03:29:23,218 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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63)