./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22ba795826618dfa50b90a88d5a4c30adee7dfead438325f939eb97a379da897 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:46:32,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:46:32,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:46:32,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:46:32,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:46:32,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:46:32,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:46:32,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:46:32,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:46:32,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:46:32,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:46:32,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:46:32,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:46:32,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:46:32,509 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:46:32,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:46:32,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:46:32,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:46:32,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:46:32,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:46:32,511 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:46:32,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:46:32,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:46:32,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22ba795826618dfa50b90a88d5a4c30adee7dfead438325f939eb97a379da897 [2025-03-14 00:46:32,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:46:32,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:46:32,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:46:32,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:46:32,746 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:46:32,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2025-03-14 00:46:33,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8b9368b/5dbd842af46c4128b0928f773ff77931/FLAGa82c5f48c [2025-03-14 00:46:34,089 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:46:34,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2025-03-14 00:46:34,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8b9368b/5dbd842af46c4128b0928f773ff77931/FLAGa82c5f48c [2025-03-14 00:46:34,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8b9368b/5dbd842af46c4128b0928f773ff77931 [2025-03-14 00:46:34,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:46:34,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:46:34,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:46:34,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:46:34,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:46:34,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae6c4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34, skipping insertion in model container [2025-03-14 00:46:34,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:46:34,373 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/35_double_lock_p3_vs.i[30703,30716] [2025-03-14 00:46:34,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:46:34,394 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:46:34,430 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/35_double_lock_p3_vs.i[30703,30716] [2025-03-14 00:46:34,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:46:34,458 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:46:34,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34 WrapperNode [2025-03-14 00:46:34,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:46:34,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:46:34,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:46:34,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:46:34,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,482 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-14 00:46:34,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:46:34,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:46:34,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:46:34,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:46:34,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,499 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-14 00:46:34,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:46:34,507 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:46:34,507 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:46:34,507 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:46:34,508 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:46:34,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:46:34,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:46:34,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:46:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-14 00:46:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-14 00:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 00:46:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 00:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:46:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:46:34,549 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:46:34,635 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:46:34,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:46:34,759 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:46:34,760 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:46:34,760 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:46:34,854 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:46:34,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:46:34 BoogieIcfgContainer [2025-03-14 00:46:34,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:46:34,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:46:34,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:46:34,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:46:34,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:46:34" (1/3) ... [2025-03-14 00:46:34,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9084ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:46:34, skipping insertion in model container [2025-03-14 00:46:34,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (2/3) ... [2025-03-14 00:46:34,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9084ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:46:34, skipping insertion in model container [2025-03-14 00:46:34,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:46:34" (3/3) ... [2025-03-14 00:46:34,861 INFO L128 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs.i [2025-03-14 00:46:34,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:46:34,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 35_double_lock_p3_vs.i that has 3 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-14 00:46:34,872 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:46:34,899 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:34,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 70 flow [2025-03-14 00:46:34,946 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-03-14 00:46:34,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:46:34,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-03-14 00:46:34,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 70 flow [2025-03-14 00:46:34,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 30 transitions, 67 flow [2025-03-14 00:46:34,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:34,974 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=PETRI_NET, 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;@100e3924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:34,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:46:34,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:34,982 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-14 00:46:34,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:46:34,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:34,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:34,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:46:34,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1360015076, now seen corresponding path program 1 times [2025-03-14 00:46:34,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:34,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287322665] [2025-03-14 00:46:34,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:35,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:35,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:35,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:35,203 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-14 00:46:35,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287322665] [2025-03-14 00:46:35,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287322665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:35,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:35,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:35,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214508420] [2025-03-14 00:46:35,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:35,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:35,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:35,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:35,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-03-14 00:46:35,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-14 00:46:35,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:35,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-03-14 00:46:35,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:35,349 INFO L124 PetriNetUnfolderBase]: 140/267 cut-off events. [2025-03-14 00:46:35,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:46:35,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 267 events. 140/267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1163 event pairs, 130 based on Foata normal form. 35/291 useless extension candidates. Maximal degree in co-relation 517. Up to 248 conditions per place. [2025-03-14 00:46:35,354 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 18 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2025-03-14 00:46:35,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 95 flow [2025-03-14 00:46:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-14 00:46:35,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2025-03-14 00:46:35,363 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 67 flow. Second operand 3 states and 46 transitions. [2025-03-14 00:46:35,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 95 flow [2025-03-14 00:46:35,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:35,370 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 58 flow [2025-03-14 00:46:35,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2025-03-14 00:46:35,375 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2025-03-14 00:46:35,376 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 58 flow [2025-03-14 00:46:35,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-14 00:46:35,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:35,376 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:35,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:46:35,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:46:35,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash -86038149, now seen corresponding path program 1 times [2025-03-14 00:46:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025085398] [2025-03-14 00:46:35,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:35,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:46:35,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:46:35,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:35,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:46:35,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:46:35,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:46:35,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:35,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:46:35,437 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:46:35,438 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-14 00:46:35,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-14 00:46:35,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 00:46:35,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-14 00:46:35,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:46:35,441 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 00:46:35,443 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:46:35,443 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 00:46:35,491 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:35,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 55 transitions, 130 flow [2025-03-14 00:46:35,503 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2025-03-14 00:46:35,506 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:46:35,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 48 events. 4/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 55. Up to 3 conditions per place. [2025-03-14 00:46:35,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 55 transitions, 130 flow [2025-03-14 00:46:35,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 43 transitions, 99 flow [2025-03-14 00:46:35,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:35,508 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=PETRI_NET, 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;@100e3924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:35,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 00:46:35,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:35,514 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-03-14 00:46:35,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:46:35,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:35,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:35,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 00:46:35,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:35,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1808994061, now seen corresponding path program 1 times [2025-03-14 00:46:35,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:35,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036811350] [2025-03-14 00:46:35,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:35,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:35,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:35,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:35,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:35,555 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-14 00:46:35,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:35,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036811350] [2025-03-14 00:46:35,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036811350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:35,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:35,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:35,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920751116] [2025-03-14 00:46:35,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:35,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:35,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:35,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:35,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:35,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 55 [2025-03-14 00:46:35,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-14 00:46:35,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:35,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 55 [2025-03-14 00:46:35,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:35,940 INFO L124 PetriNetUnfolderBase]: 2714/4053 cut-off events. [2025-03-14 00:46:35,940 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-03-14 00:46:35,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8076 conditions, 4053 events. 2714/4053 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22393 event pairs, 2506 based on Foata normal form. 398/4214 useless extension candidates. Maximal degree in co-relation 8065. Up to 3911 conditions per place. [2025-03-14 00:46:35,974 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 30 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-03-14 00:46:35,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 151 flow [2025-03-14 00:46:35,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-14 00:46:35,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2025-03-14 00:46:35,976 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 99 flow. Second operand 3 states and 76 transitions. [2025-03-14 00:46:35,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 151 flow [2025-03-14 00:46:35,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:35,978 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 90 flow [2025-03-14 00:46:35,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-03-14 00:46:35,978 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2025-03-14 00:46:35,980 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 90 flow [2025-03-14 00:46:35,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-14 00:46:35,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:35,980 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:35,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:46:35,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 00:46:35,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1511599182, now seen corresponding path program 1 times [2025-03-14 00:46:35,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:35,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597657482] [2025-03-14 00:46:35,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:35,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:35,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:46:36,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:46:36,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:36,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:36,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:46:36,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:46:36,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:46:36,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:36,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:36,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:46:36,028 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:46:36,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-14 00:46:36,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 00:46:36,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-14 00:46:36,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 00:46:36,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 00:46:36,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:46:36,029 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 00:46:36,030 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:46:36,030 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 00:46:36,068 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:36,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 194 flow [2025-03-14 00:46:36,112 INFO L124 PetriNetUnfolderBase]: 5/64 cut-off events. [2025-03-14 00:46:36,112 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 00:46:36,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 64 events. 5/64 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 158 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2025-03-14 00:46:36,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 194 flow [2025-03-14 00:46:36,115 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 56 transitions, 133 flow [2025-03-14 00:46:36,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:36,117 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=PETRI_NET, 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;@100e3924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:36,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:46:36,119 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:36,122 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-14 00:46:36,122 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:46:36,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:36,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:36,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:46:36,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1732261288, now seen corresponding path program 1 times [2025-03-14 00:46:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:36,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765937831] [2025-03-14 00:46:36,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:36,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:36,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:36,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:36,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:36,168 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-14 00:46:36,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:36,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765937831] [2025-03-14 00:46:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765937831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540549917] [2025-03-14 00:46:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:36,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:36,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:36,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 79 [2025-03-14 00:46:36,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-14 00:46:36,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:36,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 79 [2025-03-14 00:46:36,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:39,309 INFO L124 PetriNetUnfolderBase]: 43007/57636 cut-off events. [2025-03-14 00:46:39,309 INFO L125 PetriNetUnfolderBase]: For 2553/2553 co-relation queries the response was YES. [2025-03-14 00:46:39,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115384 conditions, 57636 events. 43007/57636 cut-off events. For 2553/2553 co-relation queries the response was YES. Maximal size of possible extension queue 2013. Compared 355250 event pairs, 39532 based on Foata normal form. 4391/58214 useless extension candidates. Maximal degree in co-relation 115372. Up to 56183 conditions per place. [2025-03-14 00:46:39,593 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 42 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2025-03-14 00:46:39,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 209 flow [2025-03-14 00:46:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-14 00:46:39,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4472573839662447 [2025-03-14 00:46:39,598 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 133 flow. Second operand 3 states and 106 transitions. [2025-03-14 00:46:39,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 209 flow [2025-03-14 00:46:39,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 206 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:39,604 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 122 flow [2025-03-14 00:46:39,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2025-03-14 00:46:39,606 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2025-03-14 00:46:39,606 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 122 flow [2025-03-14 00:46:39,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-14 00:46:39,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:39,607 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:39,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:46:39,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:46:39,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:39,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1159155226, now seen corresponding path program 1 times [2025-03-14 00:46:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:39,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570747378] [2025-03-14 00:46:39,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:39,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:39,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:46:39,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:46:39,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:39,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:39,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:46:39,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:46:39,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:46:39,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:39,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:39,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:46:39,642 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:46:39,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-14 00:46:39,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-14 00:46:39,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-14 00:46:39,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-14 00:46:39,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-14 00:46:39,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-14 00:46:39,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:46:39,643 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 00:46:39,643 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:46:39,643 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 00:46:39,675 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:39,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 103 transitions, 262 flow [2025-03-14 00:46:39,683 INFO L124 PetriNetUnfolderBase]: 6/80 cut-off events. [2025-03-14 00:46:39,684 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 00:46:39,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 80 events. 6/80 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 96. Up to 5 conditions per place. [2025-03-14 00:46:39,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 103 transitions, 262 flow [2025-03-14 00:46:39,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 69 transitions, 169 flow [2025-03-14 00:46:39,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:39,687 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=PETRI_NET, 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;@100e3924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:39,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 00:46:39,688 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:39,689 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-03-14 00:46:39,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:46:39,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:39,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:39,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:46:39,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1110730657, now seen corresponding path program 1 times [2025-03-14 00:46:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:39,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596834052] [2025-03-14 00:46:39,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:39,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:39,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:39,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:39,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:39,716 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-14 00:46:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:39,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596834052] [2025-03-14 00:46:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596834052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536422454] [2025-03-14 00:46:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:39,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:39,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:39,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:39,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 103 [2025-03-14 00:46:39,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-14 00:46:39,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:39,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 103 [2025-03-14 00:46:39,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand