./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0cc2344d8bedffb786f66d288e651407abc416f1e22d065ca4595f05e214f2a3 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-19 17:39:39,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-19 17:39:39,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-19 17:39:39,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-19 17:39:39,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-19 17:39:39,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-19 17:39:39,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-19 17:39:39,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-19 17:39:39,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-19 17:39:39,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-19 17:39:39,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-19 17:39:39,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-19 17:39:39,795 INFO L153 SettingsManager]: * Use SBE=true [2025-03-19 17:39:39,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-19 17:39:39,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-19 17:39:39,796 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-19 17:39:39,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-19 17:39:39,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-19 17:39:39,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-19 17:39:39,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-19 17:39:39,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-19 17:39:39,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 17:39:39,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-19 17:39:39,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> 0cc2344d8bedffb786f66d288e651407abc416f1e22d065ca4595f05e214f2a3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> SLEEP_NEW_STATES [2025-03-19 17:39:40,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-19 17:39:40,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-19 17:39:40,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-19 17:39:40,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-19 17:39:40,035 INFO L274 PluginConnector]: CDTParser initialized [2025-03-19 17:39:40,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i [2025-03-19 17:39:41,281 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0bd73cc8a/779ecca7c6ad445cbfe1f0816d351ce2/FLAGa22b0bcbe [2025-03-19 17:39:41,465 INFO L389 CDTParser]: Found 1 translation units. [2025-03-19 17:39:41,465 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i [2025-03-19 17:39:41,481 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0bd73cc8a/779ecca7c6ad445cbfe1f0816d351ce2/FLAGa22b0bcbe [2025-03-19 17:39:42,332 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0bd73cc8a/779ecca7c6ad445cbfe1f0816d351ce2 [2025-03-19 17:39:42,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-19 17:39:42,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-19 17:39:42,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-19 17:39:42,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-19 17:39:42,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-19 17:39:42,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b65b1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42, skipping insertion in model container [2025-03-19 17:39:42,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-19 17:39:42,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30297,30310] [2025-03-19 17:39:42,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30487,30500] [2025-03-19 17:39:42,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31293,31306] [2025-03-19 17:39:42,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31584,31597] [2025-03-19 17:39:42,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31812,31825] [2025-03-19 17:39:42,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32286,32299] [2025-03-19 17:39:42,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32509,32522] [2025-03-19 17:39:42,589 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32707,32720] [2025-03-19 17:39:42,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32902,32915] [2025-03-19 17:39:42,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33095,33108] [2025-03-19 17:39:42,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33516,33529] [2025-03-19 17:39:42,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 17:39:42,603 INFO L200 MainTranslator]: Completed pre-run [2025-03-19 17:39:42,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30297,30310] [2025-03-19 17:39:42,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30487,30500] [2025-03-19 17:39:42,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31293,31306] [2025-03-19 17:39:42,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31584,31597] [2025-03-19 17:39:42,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31812,31825] [2025-03-19 17:39:42,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32286,32299] [2025-03-19 17:39:42,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32509,32522] [2025-03-19 17:39:42,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32707,32720] [2025-03-19 17:39:42,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32902,32915] [2025-03-19 17:39:42,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33095,33108] [2025-03-19 17:39:42,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33516,33529] [2025-03-19 17:39:42,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 17:39:42,684 INFO L204 MainTranslator]: Completed translation [2025-03-19 17:39:42,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42 WrapperNode [2025-03-19 17:39:42,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-19 17:39:42,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-19 17:39:42,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-19 17:39:42,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-19 17:39:42,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,736 INFO L138 Inliner]: procedures = 180, calls = 48, calls flagged for inlining = 43, calls inlined = 68, statements flattened = 450 [2025-03-19 17:39:42,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-19 17:39:42,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-19 17:39:42,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-19 17:39:42,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-19 17:39:42,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-19 17:39:42,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-19 17:39:42,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-19 17:39:42,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-19 17:39:42,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (1/1) ... [2025-03-19 17:39:42,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 17:39:42,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 17:39:42,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-19 17:39:42,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-19 17:39:42,828 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-19 17:39:42,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-19 17:39:42,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-19 17:39:42,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-19 17:39:42,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-19 17:39:42,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-19 17:39:42,829 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-19 17:39:42,913 INFO L234 CfgBuilder]: Building ICFG [2025-03-19 17:39:42,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-19 17:39:43,282 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-19 17:39:43,283 INFO L283 CfgBuilder]: Performing block encoding [2025-03-19 17:39:43,464 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-19 17:39:43,464 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-19 17:39:43,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 05:39:43 BoogieIcfgContainer [2025-03-19 17:39:43,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-19 17:39:43,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-19 17:39:43,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-19 17:39:43,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-19 17:39:43,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 05:39:42" (1/3) ... [2025-03-19 17:39:43,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e166f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 05:39:43, skipping insertion in model container [2025-03-19 17:39:43,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 05:39:42" (2/3) ... [2025-03-19 17:39:43,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e166f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 05:39:43, skipping insertion in model container [2025-03-19 17:39:43,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 05:39:43" (3/3) ... [2025-03-19 17:39:43,470 INFO L128 eAbstractionObserver]: Analyzing ICFG 43_NetBSD_sysmon_power_sliced.i [2025-03-19 17:39:43,479 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-19 17:39:43,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 43_NetBSD_sysmon_power_sliced.i that has 2 procedures, 124 locations, 176 edges, 1 initial locations, 3 loop locations, and 11 error locations. [2025-03-19 17:39:43,481 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-19 17:39:43,524 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-19 17:39:43,553 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:39:43,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-19 17:39:43,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 17:39:43,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-03-19 17:39:43,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-03-19 17:39:43,607 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 17:39:43,611 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2025-03-19 17:39:43,618 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49e06079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:39:43,618 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-19 17:39:43,635 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-03-19 17:39:43,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:39:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash -685730022, now seen corresponding path program 1 times [2025-03-19 17:39:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:39:43,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598650230] [2025-03-19 17:39:43,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:39:43,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:39:43,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-19 17:39:43,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-19 17:39:43,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:39:43,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 17:39:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 17:39:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 17:39:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598650230] [2025-03-19 17:39:43,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598650230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 17:39:43,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 17:39:43,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 17:39:43,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853271741] [2025-03-19 17:39:43,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 17:39:43,874 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 17:39:43,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 17:39:43,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 17:39:43,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 17:39:43,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:39:43,888 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 17:39:43,889 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 17:39:43,889 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:39:44,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:39:44,050 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-19 17:39:44,050 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-03-19 17:39:44,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:39:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1324454113, now seen corresponding path program 1 times [2025-03-19 17:39:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:39:44,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823349295] [2025-03-19 17:39:44,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:39:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:39:44,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-19 17:39:44,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-19 17:39:44,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:39:44,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 17:39:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 17:39:44,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 17:39:44,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823349295] [2025-03-19 17:39:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823349295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 17:39:44,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 17:39:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 17:39:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891113283] [2025-03-19 17:39:44,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 17:39:44,118 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 17:39:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 17:39:44,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 17:39:44,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 17:39:44,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:39:44,118 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 17:39:44,118 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 17:39:44,118 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:39:44,118 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:39:44,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:39:44,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:39:44,366 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2025-03-19 17:39:44,367 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2025-03-19 17:39:44,367 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-19 17:39:44,370 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-19 17:39:44,371 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2025-03-19 17:39:44,378 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:39:44,378 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 17:39:44,378 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 17:39:44,379 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49e06079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:39:44,379 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-19 17:39:44,380 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 17:39:44,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:39:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1295220781, now seen corresponding path program 1 times [2025-03-19 17:39:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:39:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557315210] [2025-03-19 17:39:44,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:39:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:39:44,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-19 17:39:44,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-19 17:39:44,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:39:44,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 17:39:44,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 17:39:44,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-19 17:39:44,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-19 17:39:44,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:39:44,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 17:39:44,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-19 17:39:44,417 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 17:39:44,417 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-03-19 17:39:44,417 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-19 17:39:44,418 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-19 17:39:44,418 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2025-03-19 17:39:44,418 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-19 17:39:44,418 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-19 17:39:44,472 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-19 17:39:44,476 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:39:44,488 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 17:39:44,488 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 17:39:44,489 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49e06079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:39:44,489 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-19 17:39:44,494 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 17:39:44,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:39:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash 606096858, now seen corresponding path program 1 times [2025-03-19 17:39:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:39:44,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83106895] [2025-03-19 17:39:44,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:39:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:39:44,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-19 17:39:44,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-19 17:39:44,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:39:44,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 17:39:44,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 17:39:44,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-19 17:39:44,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-19 17:39:44,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:39:44,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 17:39:44,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-19 17:39:44,519 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 17:39:44,519 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-03-19 17:39:44,519 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-19 17:39:44,519 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-19 17:39:44,519 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2025-03-19 17:39:44,519 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-19 17:39:44,520 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-19 17:39:44,585 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-19 17:39:44,590 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:39:44,608 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 17:39:44,609 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2025-03-19 17:39:44,609 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49e06079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:39:44,610 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-19 17:39:56,241 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-03-19 17:39:56,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:39:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash -893663943, now seen corresponding path program 1 times [2025-03-19 17:39:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:39:56,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512959630] [2025-03-19 17:39:56,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:39:56,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:39:56,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-19 17:39:56,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-19 17:39:56,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:39:56,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 17:39:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 17:39:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 17:39:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512959630] [2025-03-19 17:39:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512959630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 17:39:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 17:39:56,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 17:39:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732512428] [2025-03-19 17:39:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 17:39:56,341 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 17:39:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 17:39:56,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 17:39:56,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 17:39:56,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:39:56,341 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 17:39:56,342 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 17:39:56,342 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:39:58,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:39:58,846 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-19 17:39:58,847 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-03-19 17:39:58,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:39:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2119839863, now seen corresponding path program 1 times [2025-03-19 17:39:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:39:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853164974] [2025-03-19 17:39:58,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:39:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:39:58,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-19 17:39:58,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-19 17:39:58,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:39:58,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 17:39:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 17:39:58,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 17:39:58,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853164974] [2025-03-19 17:39:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853164974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 17:39:58,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 17:39:58,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 17:39:58,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027149502] [2025-03-19 17:39:58,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 17:39:58,925 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 17:39:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 17:39:58,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 17:39:58,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 17:39:58,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:39:58,926 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 17:39:58,926 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 17:39:58,926 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:39:58,926 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:22,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:44:22,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:44:22,836 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-03-19 17:44:22,836 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2025-03-19 17:44:22,836 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2025-03-19 17:44:22,836 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2025-03-19 17:44:22,837 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2025-03-19 17:44:22,837 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2025-03-19 17:44:22,837 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2025-03-19 17:44:22,837 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2025-03-19 17:44:22,837 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2025-03-19 17:44:22,837 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2025-03-19 17:44:22,837 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2025-03-19 17:44:22,837 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-19 17:44:22,838 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-19 17:44:22,838 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/4) [2025-03-19 17:44:22,844 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:44:22,845 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 17:44:22,845 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 17:44:22,845 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49e06079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:44:22,845 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-19 17:44:22,847 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 17:44:22,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:44:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash -917479104, now seen corresponding path program 1 times [2025-03-19 17:44:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:44:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770524223] [2025-03-19 17:44:22,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:44:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:44:22,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-19 17:44:22,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-19 17:44:22,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:44:22,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 17:44:22,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 17:44:22,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-19 17:44:22,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-19 17:44:22,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:44:22,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 17:44:22,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-19 17:44:22,867 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 17:44:22,867 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-03-19 17:44:22,868 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-19 17:44:22,868 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-19 17:44:22,869 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2025-03-19 17:44:22,869 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-19 17:44:22,869 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-19 17:44:22,903 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-19 17:44:22,907 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:44:22,926 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 17:44:22,926 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2025-03-19 17:44:22,926 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49e06079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 17:44:22,926 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-19 17:44:22,945 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-03-19 17:44:22,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:44:22,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1613182115, now seen corresponding path program 1 times [2025-03-19 17:44:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:44:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42990297] [2025-03-19 17:44:22,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:44:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:44:22,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-19 17:44:22,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-19 17:44:22,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:44:22,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 17:44:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 17:44:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 17:44:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42990297] [2025-03-19 17:44:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42990297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 17:44:22,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 17:44:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-19 17:44:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715211432] [2025-03-19 17:44:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 17:44:22,985 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-19 17:44:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 17:44:22,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-19 17:44:22,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-19 17:44:22,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:22,985 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 17:44:22,986 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 17:44:22,986 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:23,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:23,015 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-19 17:44:23,015 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-03-19 17:44:23,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:44:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1619188889, now seen corresponding path program 1 times [2025-03-19 17:44:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:44:23,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369655786] [2025-03-19 17:44:23,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:44:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:44:23,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-19 17:44:23,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-19 17:44:23,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:44:23,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 17:44:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 17:44:23,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 17:44:23,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369655786] [2025-03-19 17:44:23,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369655786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 17:44:23,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 17:44:23,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 17:44:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90449953] [2025-03-19 17:44:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 17:44:23,127 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 17:44:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 17:44:23,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 17:44:23,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 17:44:23,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:23,128 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 17:44:23,128 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 17:44:23,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:23,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:23,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:23,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:44:23,284 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-19 17:44:23,284 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-03-19 17:44:23,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 17:44:23,284 INFO L85 PathProgramCache]: Analyzing trace with hash -450589823, now seen corresponding path program 1 times [2025-03-19 17:44:23,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 17:44:23,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127374045] [2025-03-19 17:44:23,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 17:44:23,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 17:44:23,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-19 17:44:23,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-19 17:44:23,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 17:44:23,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 17:44:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 17:44:23,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 17:44:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127374045] [2025-03-19 17:44:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127374045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 17:44:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 17:44:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 17:44:23,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770977714] [2025-03-19 17:44:23,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 17:44:23,327 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 17:44:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 17:44:23,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 17:44:23,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 17:44:23,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:23,327 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 17:44:23,327 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-19 17:44:23,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 17:44:23,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 17:44:23,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.