./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.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-lit/sssc12.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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:54:40,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:54:40,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:54:40,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:54:40,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:54:40,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:54:40,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:54:40,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:54:40,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:54:40,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:54:40,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:54:40,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:54:40,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:54:40,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:54:40,338 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:54:40,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:54:40,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:54:40,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:54:40,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:54:40,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:54:40,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:54:40,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:54:40,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:54:40,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:40,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:54:40,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:54:40,340 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:54:40,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:54:40,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:54:40,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:54:40,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:54:40,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:54:40,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:54:40,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:54:40,341 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-03-14 00:54:40,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:54:40,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:54:40,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:54:40,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:54:40,598 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:54:40,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-14 00:54:41,783 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a05ef4e4/834ae08aae084408bc33b71c42595707/FLAGf518330df [2025-03-14 00:54:42,117 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:54:42,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-14 00:54:42,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a05ef4e4/834ae08aae084408bc33b71c42595707/FLAGf518330df [2025-03-14 00:54:42,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a05ef4e4/834ae08aae084408bc33b71c42595707 [2025-03-14 00:54:42,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:54:42,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:54:42,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:42,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:54:42,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:54:42,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fed8a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42, skipping insertion in model container [2025-03-14 00:54:42,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:54:42,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i[47777,47790] [2025-03-14 00:54:42,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:42,681 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:54:42,725 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-lit/sssc12.i[47777,47790] [2025-03-14 00:54:42,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:42,774 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:54:42,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42 WrapperNode [2025-03-14 00:54:42,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:42,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:42,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:54:42,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:54:42,783 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:54:42" (1/1) ... [2025-03-14 00:54:42,802 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:54:42" (1/1) ... [2025-03-14 00:54:42,819 INFO L138 Inliner]: procedures = 272, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-03-14 00:54:42,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:42,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:54:42,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:54:42,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:54:42,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,852 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 1, 5]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-03-14 00:54:42,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:54:42,869 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:54:42,869 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:54:42,869 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:54:42,870 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (1/1) ... [2025-03-14 00:54:42,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:42,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:54:42,900 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:54:42,905 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:54:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-14 00:54:42,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-14 00:54:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:54:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:54:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:54:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 00:54:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:54:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 00:54:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:54:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:54:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:54:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:54:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:54:42,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:54:42,923 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:54:43,026 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:54:43,028 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:54:43,162 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:54:43,163 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:54:43,163 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:54:43,304 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:54:43,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:43 BoogieIcfgContainer [2025-03-14 00:54:43,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:54:43,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:54:43,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:54:43,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:54:43,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:54:42" (1/3) ... [2025-03-14 00:54:43,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e40a25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:43, skipping insertion in model container [2025-03-14 00:54:43,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:42" (2/3) ... [2025-03-14 00:54:43,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e40a25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:43, skipping insertion in model container [2025-03-14 00:54:43,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:43" (3/3) ... [2025-03-14 00:54:43,318 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-03-14 00:54:43,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:54:43,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-14 00:54:43,332 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:54:43,368 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:54:43,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 18 transitions, 40 flow [2025-03-14 00:54:43,428 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-03-14 00:54:43,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:43,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 20 events. 2/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-03-14 00:54:43,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 18 transitions, 40 flow [2025-03-14 00:54:43,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 18 transitions, 40 flow [2025-03-14 00:54:43,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:43,450 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;@682bdc85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:43,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 00:54:43,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:43,456 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-14 00:54:43,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:43,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:43,456 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-14 00:54:43,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-14 00:54:43,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 895973485, now seen corresponding path program 1 times [2025-03-14 00:54:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:43,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489997576] [2025-03-14 00:54:43,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:43,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:43,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-14 00:54:43,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-14 00:54:43,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:43,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:54:43,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:54:43,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-14 00:54:43,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-14 00:54:43,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:43,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:54:43,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:54:43,619 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:54:43,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-14 00:54:43,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-14 00:54:43,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-14 00:54:43,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:54:43,623 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-14 00:54:43,626 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:54:43,626 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 00:54:43,648 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:54:43,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 72 flow [2025-03-14 00:54:43,662 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-03-14 00:54:43,664 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:54:43,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 36 events. 4/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-03-14 00:54:43,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 72 flow [2025-03-14 00:54:43,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 31 transitions, 72 flow [2025-03-14 00:54:43,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:43,667 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;@682bdc85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:43,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:54:43,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:43,676 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-14 00:54:43,676 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:54:43,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:43,676 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-14 00:54:43,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 00:54:43,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1440960105, now seen corresponding path program 1 times [2025-03-14 00:54:43,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:43,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299424415] [2025-03-14 00:54:43,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:43,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:54:43,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:54:43,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:43,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:54:43,697 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:54:43,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:54:43,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:54:43,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:43,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:54:43,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:54:43,723 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:54:43,724 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-14 00:54:43,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-14 00:54:43,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-14 00:54:43,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-14 00:54:43,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:54:43,728 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-14 00:54:43,729 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:54:43,729 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 00:54:43,752 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:54:43,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 106 flow [2025-03-14 00:54:43,766 INFO L124 PetriNetUnfolderBase]: 6/52 cut-off events. [2025-03-14 00:54:43,767 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 00:54:43,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 6/52 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 43. Up to 4 conditions per place. [2025-03-14 00:54:43,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 106 flow [2025-03-14 00:54:43,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 106 flow [2025-03-14 00:54:43,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:43,771 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;@682bdc85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:43,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 00:54:43,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:43,781 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-03-14 00:54:43,781 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 00:54:43,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:43,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:43,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:54:43,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash -140862711, now seen corresponding path program 1 times [2025-03-14 00:54:43,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:43,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88670642] [2025-03-14 00:54:43,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:43,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:43,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:54:43,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:54:43,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:43,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:44,128 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:54:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88670642] [2025-03-14 00:54:44,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88670642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:44,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:44,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441183671] [2025-03-14 00:54:44,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:44,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:44,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:44,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:44,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-03-14 00:54:44,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:54:44,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:44,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-03-14 00:54:44,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:45,507 INFO L124 PetriNetUnfolderBase]: 8725/13362 cut-off events. [2025-03-14 00:54:45,507 INFO L125 PetriNetUnfolderBase]: For 721/721 co-relation queries the response was YES. [2025-03-14 00:54:45,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25734 conditions, 13362 events. 8725/13362 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 85420 event pairs, 1834 based on Foata normal form. 963/11922 useless extension candidates. Maximal degree in co-relation 17547. Up to 6223 conditions per place. [2025-03-14 00:54:45,594 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 101 selfloop transitions, 12 changer transitions 0/124 dead transitions. [2025-03-14 00:54:45,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 124 transitions, 552 flow [2025-03-14 00:54:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:54:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:54:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2025-03-14 00:54:45,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688311688311688 [2025-03-14 00:54:45,606 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 106 flow. Second operand 7 states and 206 transitions. [2025-03-14 00:54:45,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 124 transitions, 552 flow [2025-03-14 00:54:45,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 540 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-14 00:54:45,616 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 180 flow [2025-03-14 00:54:45,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-03-14 00:54:45,621 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2025-03-14 00:54:45,621 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 180 flow [2025-03-14 00:54:45,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:54:45,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:45,622 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-14 00:54:45,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:54:45,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:54:45,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1866264940, now seen corresponding path program 1 times [2025-03-14 00:54:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318227944] [2025-03-14 00:54:45,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:45,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 00:54:45,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 00:54:45,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:45,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:54:45,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:54:45,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 00:54:45,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 00:54:45,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:45,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:54:45,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:54:45,664 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:54:45,664 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-14 00:54:45,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 00:54:45,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-14 00:54:45,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 00:54:45,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 00:54:45,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:54:45,664 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 00:54:45,665 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:54:45,665 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 00:54:45,702 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:54:45,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 142 flow [2025-03-14 00:54:45,713 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-03-14 00:54:45,714 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 00:54:45,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 68 events. 8/68 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 64. Up to 5 conditions per place. [2025-03-14 00:54:45,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 57 transitions, 142 flow [2025-03-14 00:54:45,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 57 transitions, 142 flow [2025-03-14 00:54:45,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:45,717 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;@682bdc85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:45,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:54:45,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:45,724 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-03-14 00:54:45,724 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 00:54:45,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:45,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:45,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:45,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash -969216082, now seen corresponding path program 1 times [2025-03-14 00:54:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:45,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137080452] [2025-03-14 00:54:45,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:45,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:54:45,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:54:45,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:45,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:45,876 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:54:45,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:45,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137080452] [2025-03-14 00:54:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137080452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:45,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:45,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371907050] [2025-03-14 00:54:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:45,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:45,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:45,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:45,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-14 00:54:45,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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:54:45,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:45,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-14 00:54:45,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:52,874 INFO L124 PetriNetUnfolderBase]: 98531/139216 cut-off events. [2025-03-14 00:54:52,874 INFO L125 PetriNetUnfolderBase]: For 9994/9994 co-relation queries the response was YES. [2025-03-14 00:54:53,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268248 conditions, 139216 events. 98531/139216 cut-off events. For 9994/9994 co-relation queries the response was YES. Maximal size of possible extension queue 4519. Compared 1019705 event pairs, 23890 based on Foata normal form. 11088/124117 useless extension candidates. Maximal degree in co-relation 136311. Up to 65858 conditions per place. [2025-03-14 00:54:53,721 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 139 selfloop transitions, 14 changer transitions 0/168 dead transitions. [2025-03-14 00:54:53,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 168 transitions, 775 flow [2025-03-14 00:54:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:54:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:54:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 278 transitions. [2025-03-14 00:54:53,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6967418546365914 [2025-03-14 00:54:53,724 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 142 flow. Second operand 7 states and 278 transitions. [2025-03-14 00:54:53,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 168 transitions, 775 flow [2025-03-14 00:54:53,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 168 transitions, 739 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-14 00:54:53,736 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 226 flow [2025-03-14 00:54:53,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-03-14 00:54:53,737 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-03-14 00:54:53,739 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 226 flow [2025-03-14 00:54:53,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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:54:53,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:53,739 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:53,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:54:53,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:53,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2109218133, now seen corresponding path program 1 times [2025-03-14 00:54:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:53,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301677642] [2025-03-14 00:54:53,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:53,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:54:53,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:54:53,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:53,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:53,919 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:54:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:53,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301677642] [2025-03-14 00:54:53,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301677642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:53,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:53,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488961428] [2025-03-14 00:54:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:53,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:53,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:53,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:53,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-14 00:54:53,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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:54:53,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:53,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-14 00:54:53,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:05,275 INFO L124 PetriNetUnfolderBase]: 153451/218781 cut-off events. [2025-03-14 00:55:05,275 INFO L125 PetriNetUnfolderBase]: For 84512/86609 co-relation queries the response was YES. [2025-03-14 00:55:05,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477648 conditions, 218781 events. 153451/218781 cut-off events. For 84512/86609 co-relation queries the response was YES. Maximal size of possible extension queue 7563. Compared 1724857 event pairs, 43744 based on Foata normal form. 0/187554 useless extension candidates. Maximal degree in co-relation 398346. Up to 112061 conditions per place. [2025-03-14 00:55:07,063 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 145 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2025-03-14 00:55:07,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 180 transitions, 948 flow [2025-03-14 00:55:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:55:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:55:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 255 transitions. [2025-03-14 00:55:07,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6390977443609023 [2025-03-14 00:55:07,065 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 226 flow. Second operand 7 states and 255 transitions. [2025-03-14 00:55:07,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 180 transitions, 948 flow [2025-03-14 00:55:07,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 180 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:55:07,409 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 346 flow [2025-03-14 00:55:07,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-14 00:55:07,409 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-03-14 00:55:07,409 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 346 flow [2025-03-14 00:55:07,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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:55:07,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:07,410 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:07,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:55:07,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:55:07,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1150113183, now seen corresponding path program 1 times [2025-03-14 00:55:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:07,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419940457] [2025-03-14 00:55:07,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:55:07,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:07,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:55:07,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:55:07,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:55:07,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:07,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:07,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419940457] [2025-03-14 00:55:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419940457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:55:07,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199518531] [2025-03-14 00:55:07,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:55:07,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:55:07,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:55:07,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:55:07,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:55:07,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:55:07,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:55:07,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:55:07,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:07,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 00:55:07,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:55:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:07,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:55:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199518531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:55:08,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:55:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-03-14 00:55:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405698362] [2025-03-14 00:55:08,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:55:08,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 00:55:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:08,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 00:55:08,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-14 00:55:08,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-14 00:55:08,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 346 flow. Second operand has 17 states, 17 states have (on average 16.764705882352942) internal successors, (285), 17 states have internal predecessors, (285), 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:55:08,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:08,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-14 00:55:08,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand