./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 15:40:23,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 15:40:23,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 15:40:23,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 15:40:23,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 15:40:23,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 15:40:23,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 15:40:23,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 15:40:23,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 15:40:23,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 15:40:23,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 15:40:23,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 15:40:23,265 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 15:40:23,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 15:40:23,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 15:40:23,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 15:40:23,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 15:40:23,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 15:40:23,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 15:40:23,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 15:40:23,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 15:40:23,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 15:40:23,267 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 15:40:23,267 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 15:40:23,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 15:40:23,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 15:40:23,268 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 15:40:23,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 15:40:23,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 15:40:23,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 15:40:23,268 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 15:40:23,268 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 15:40:23,268 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-jdk21/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 -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2025-01-23 15:40:23,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 15:40:23,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 15:40:23,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 15:40:23,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 15:40:23,552 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 15:40:23,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i [2025-01-23 15:40:24,814 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/1eda0de6a/674c1d4ebbae4ad8a202d19547f43642/FLAG0809441c7 [2025-01-23 15:40:25,063 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 15:40:25,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i [2025-01-23 15:40:25,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/1eda0de6a/674c1d4ebbae4ad8a202d19547f43642/FLAG0809441c7 [2025-01-23 15:40:25,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/1eda0de6a/674c1d4ebbae4ad8a202d19547f43642 [2025-01-23 15:40:25,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 15:40:25,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 15:40:25,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 15:40:25,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 15:40:25,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 15:40:25,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c74506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25, skipping insertion in model container [2025-01-23 15:40:25,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 15:40:25,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30297,30310] [2025-01-23 15:40:25,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30487,30500] [2025-01-23 15:40:25,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31293,31306] [2025-01-23 15:40:25,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31584,31597] [2025-01-23 15:40:25,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31812,31825] [2025-01-23 15:40:25,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32286,32299] [2025-01-23 15:40:25,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32509,32522] [2025-01-23 15:40:25,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32707,32720] [2025-01-23 15:40:25,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32902,32915] [2025-01-23 15:40:25,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33095,33108] [2025-01-23 15:40:25,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33516,33529] [2025-01-23 15:40:25,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 15:40:25,366 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 15:40:25,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30297,30310] [2025-01-23 15:40:25,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30487,30500] [2025-01-23 15:40:25,436 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31293,31306] [2025-01-23 15:40:25,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31584,31597] [2025-01-23 15:40:25,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31812,31825] [2025-01-23 15:40:25,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32286,32299] [2025-01-23 15:40:25,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32509,32522] [2025-01-23 15:40:25,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32707,32720] [2025-01-23 15:40:25,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32902,32915] [2025-01-23 15:40:25,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33095,33108] [2025-01-23 15:40:25,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33516,33529] [2025-01-23 15:40:25,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 15:40:25,481 INFO L204 MainTranslator]: Completed translation [2025-01-23 15:40:25,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25 WrapperNode [2025-01-23 15:40:25,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 15:40:25,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 15:40:25,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 15:40:25,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 15:40:25,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,533 INFO L138 Inliner]: procedures = 180, calls = 48, calls flagged for inlining = 43, calls inlined = 68, statements flattened = 450 [2025-01-23 15:40:25,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 15:40:25,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 15:40:25,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 15:40:25,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 15:40:25,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 15:40:25,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 15:40:25,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 15:40:25,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 15:40:25,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (1/1) ... [2025-01-23 15:40:25,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 15:40:25,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 15:40:25,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-23 15:40:25,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-23 15:40:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-23 15:40:25,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-23 15:40:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 15:40:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 15:40:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 15:40:25,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 15:40:25,624 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 15:40:25,704 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 15:40:25,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 15:40:26,158 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 15:40:26,158 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 15:40:26,356 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 15:40:26,356 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-23 15:40:26,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 03:40:26 BoogieIcfgContainer [2025-01-23 15:40:26,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 15:40:26,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 15:40:26,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 15:40:26,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 15:40:26,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 03:40:25" (1/3) ... [2025-01-23 15:40:26,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665c469f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 03:40:26, skipping insertion in model container [2025-01-23 15:40:26,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:40:25" (2/3) ... [2025-01-23 15:40:26,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665c469f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 03:40:26, skipping insertion in model container [2025-01-23 15:40:26,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 03:40:26" (3/3) ... [2025-01-23 15:40:26,364 INFO L128 eAbstractionObserver]: Analyzing ICFG 43_NetBSD_sysmon_power_sliced.i [2025-01-23 15:40:26,375 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 15:40:26,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 43_NetBSD_sysmon_power_sliced.i that has 2 procedures, 124 locations, 1 initial locations, 3 loop locations, and 11 error locations. [2025-01-23 15:40:26,376 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 15:40:26,433 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:40:26,463 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:40:26,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 15:40:26,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 15:40:26,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-23 15:40:26,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-23 15:40:26,535 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:40:26,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2025-01-23 15:40:26,555 INFO L333 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;@5ce88664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:40:26,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-23 15:40:26,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-01-23 15:40:26,712 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:40:26,712 INFO L139 ounterexampleChecker]: Examining path program with hash 1051529882, occurence #1 [2025-01-23 15:40:26,712 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:40:26,712 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:40:26,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:40:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -685730022, now seen corresponding path program 1 times [2025-01-23 15:40:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:40:26,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920998008] [2025-01-23 15:40:26,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:40:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:40:26,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-23 15:40:26,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-23 15:40:26,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:40:26,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:40:26,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-01-23 15:40:26,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:40:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920998008] [2025-01-23 15:40:26,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920998008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:40:26,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:40:26,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:40:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514157732] [2025-01-23 15:40:26,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:40:26,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:40:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:40:26,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:40:26,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:40:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:40:26,944 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:40:26,944 INFO L472 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-01-23 15:40:26,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:40:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:40:27,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 15:40:27,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-01-23 15:40:27,143 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:40:27,143 INFO L139 ounterexampleChecker]: Examining path program with hash -1520853290, occurence #1 [2025-01-23 15:40:27,143 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:40:27,143 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:40:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:40:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1324454113, now seen corresponding path program 1 times [2025-01-23 15:40:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:40:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616972454] [2025-01-23 15:40:27,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:40:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:40:27,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-23 15:40:27,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-23 15:40:27,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:40:27,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:40:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:40:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:40:27,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616972454] [2025-01-23 15:40:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616972454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:40:27,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:40:27,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:40:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670612592] [2025-01-23 15:40:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:40:27,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:40:27,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:40:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:40:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:40:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:40:27,218 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:40:27,218 INFO L472 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-01-23 15:40:27,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:40:27,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:40:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:40:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:40:28,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2025-01-23 15:40:28,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2025-01-23 15:40:28,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 15:40:28,379 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:40:28,380 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2025-01-23 15:40:28,383 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:40:28,383 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:40:28,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:40:28,384 INFO L333 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;@5ce88664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:40:28,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:40:28,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:40:28,386 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:40:28,386 INFO L139 ounterexampleChecker]: Examining path program with hash -323337156, occurence #1 [2025-01-23 15:40:28,386 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:40:28,386 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:40:28,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:40:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1295220781, now seen corresponding path program 1 times [2025-01-23 15:40:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:40:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204617444] [2025-01-23 15:40:28,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:40:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:40:28,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-23 15:40:28,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-23 15:40:28,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:40:28,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:40:28,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 15:40:28,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-23 15:40:28,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-23 15:40:28,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:40:28,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:40:28,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 15:40:28,415 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 15:40:28,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 15:40:28,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 15:40:28,416 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-23 15:40:28,417 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2025-01-23 15:40:28,417 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 15:40:28,417 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-23 15:40:28,456 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:40:28,461 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:40:28,470 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:40:28,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:40:28,473 INFO L333 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;@5ce88664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:40:28,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:40:28,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:40:28,599 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:40:28,600 INFO L139 ounterexampleChecker]: Examining path program with hash -985060140, occurence #1 [2025-01-23 15:40:28,600 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:40:28,600 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:40:28,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:40:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1328415346, now seen corresponding path program 1 times [2025-01-23 15:40:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:40:28,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580427054] [2025-01-23 15:40:28,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:40:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:40:28,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-23 15:40:28,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-23 15:40:28,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:40:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:40:28,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 15:40:28,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-23 15:40:28,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-23 15:40:28,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:40:28,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:40:28,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 15:40:28,631 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 15:40:28,631 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 15:40:28,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 15:40:28,633 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-23 15:40:28,633 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2025-01-23 15:40:28,633 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 15:40:28,633 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-23 15:40:28,679 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:40:28,682 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:40:28,699 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:40:28,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2025-01-23 15:40:28,700 INFO L333 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;@5ce88664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:40:28,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-23 15:40:28,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-01-23 15:40:28,915 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:40:28,915 INFO L139 ounterexampleChecker]: Examining path program with hash -441536049, occurence #1 [2025-01-23 15:40:28,915 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:40:28,915 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:40:28,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:40:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash -780806215, now seen corresponding path program 1 times [2025-01-23 15:40:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:40:28,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210679160] [2025-01-23 15:40:28,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:40:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:40:28,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-23 15:40:28,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 15:40:28,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:40:28,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:40:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:40:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:40:29,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210679160] [2025-01-23 15:40:29,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210679160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:40:29,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:40:29,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:40:29,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203311081] [2025-01-23 15:40:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:40:29,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:40:29,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:40:29,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:40:29,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:40:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:40:29,032 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:40:29,032 INFO L472 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-01-23 15:40:29,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:40:34,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:40:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 15:40:34,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-01-23 15:40:34,073 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:40:34,074 INFO L139 ounterexampleChecker]: Examining path program with hash -1593286661, occurence #1 [2025-01-23 15:40:34,074 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:40:34,074 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:40:34,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:40:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash -475939491, now seen corresponding path program 1 times [2025-01-23 15:40:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:40:34,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814190673] [2025-01-23 15:40:34,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:40:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:40:34,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-23 15:40:34,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-23 15:40:34,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:40:34,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:40:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:40:34,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:40:34,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814190673] [2025-01-23 15:40:34,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814190673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:40:34,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:40:34,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:40:34,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732339635] [2025-01-23 15:40:34,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:40:34,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:40:34,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:40:34,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:40:34,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:40:34,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:40:34,194 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:40:34,194 INFO L472 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-01-23 15:40:34,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:40:34,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:41,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:45:41,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2025-01-23 15:45:41,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2025-01-23 15:45:41,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2025-01-23 15:45:41,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-23 15:45:41,334 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:45:41,334 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/4) [2025-01-23 15:45:41,337 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:45:41,337 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:45:41,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:45:41,338 INFO L333 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;@5ce88664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:45:41,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:45:41,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:45:41,344 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:45:41,344 INFO L139 ounterexampleChecker]: Examining path program with hash 1958880688, occurence #1 [2025-01-23 15:45:41,344 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:45:41,344 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:45:41,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:45:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1395651136, now seen corresponding path program 1 times [2025-01-23 15:45:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:45:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630156435] [2025-01-23 15:45:41,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:45:41,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:45:41,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-23 15:45:41,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-23 15:45:41,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:45:41,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:45:41,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 15:45:41,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-23 15:45:41,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-23 15:45:41,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:45:41,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:45:41,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 15:45:41,362 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 15:45:41,362 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 15:45:41,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-23 15:45:41,364 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-23 15:45:41,364 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2025-01-23 15:45:41,364 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 15:45:41,364 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-23 15:45:41,400 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:45:41,404 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:45:41,420 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:45:41,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2025-01-23 15:45:41,420 INFO L333 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;@5ce88664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:45:41,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-23 15:45:41,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-01-23 15:45:41,588 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:45:41,588 INFO L139 ounterexampleChecker]: Examining path program with hash -1621534908, occurence #1 [2025-01-23 15:45:41,588 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:45:41,588 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:45:41,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:45:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash 31344993, now seen corresponding path program 1 times [2025-01-23 15:45:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:45:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316165462] [2025-01-23 15:45:41,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:45:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:45:41,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-23 15:45:41,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-23 15:45:41,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:45:41,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:45:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:45:41,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:45:41,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316165462] [2025-01-23 15:45:41,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316165462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:45:41,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:45:41,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:45:41,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602166988] [2025-01-23 15:45:41,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:45:41,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 15:45:41,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:45:41,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 15:45:41,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 15:45:41,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:41,618 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:45:41,618 INFO L472 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-01-23 15:45:41,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:41,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-23 15:45:41,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-01-23 15:45:41,658 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:45:41,658 INFO L139 ounterexampleChecker]: Examining path program with hash 1801213045, occurence #1 [2025-01-23 15:45:41,658 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:45:41,658 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:45:41,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:45:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1827217515, now seen corresponding path program 1 times [2025-01-23 15:45:41,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:45:41,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210136026] [2025-01-23 15:45:41,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:45:41,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:45:41,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-23 15:45:41,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-23 15:45:41,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:45:41,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:45:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:45:42,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:45:42,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210136026] [2025-01-23 15:45:42,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210136026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:45:42,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:45:42,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:45:42,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833942177] [2025-01-23 15:45:42,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:45:42,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:45:42,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:45:42,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:45:42,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:45:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:42,062 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:45:42,062 INFO L472 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-01-23 15:45:42,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:42,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:45:42,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-23 15:45:42,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-01-23 15:45:42,625 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:45:42,625 INFO L139 ounterexampleChecker]: Examining path program with hash 2115999002, occurence #1 [2025-01-23 15:45:42,626 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:45:42,626 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:45:42,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:45:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1998495999, now seen corresponding path program 1 times [2025-01-23 15:45:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:45:42,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877906302] [2025-01-23 15:45:42,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:45:42,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:45:42,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-23 15:45:42,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-23 15:45:42,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:45:42,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:45:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:45:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:45:42,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877906302] [2025-01-23 15:45:42,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877906302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:45:42,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:45:42,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:45:42,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939709260] [2025-01-23 15:45:42,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:45:42,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:45:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:45:42,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:45:42,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:45:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:42,668 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:45:42,668 INFO L472 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-01-23 15:45:42,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:42,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:45:42,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.