./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/31_simple_loop5_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 d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:27:49,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:27:49,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:27:49,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:27:49,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:27:49,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:27:49,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:27:49,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:27:49,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:27:49,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:27:49,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:27:49,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:27:49,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:27:49,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:27:49,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:27:49,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:27:49,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:27:49,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:27:49,747 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 -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-03-13 21:27:49,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:27:49,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:27:49,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:27:49,972 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:27:49,972 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:27:49,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-03-13 21:27:51,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab821a663/e7942c35381243e885349bba08a54cc2/FLAGdd302c403 [2025-03-13 21:27:51,311 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:27:51,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-03-13 21:27:51,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab821a663/e7942c35381243e885349bba08a54cc2/FLAGdd302c403 [2025-03-13 21:27:51,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab821a663/e7942c35381243e885349bba08a54cc2 [2025-03-13 21:27:51,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:27:51,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:27:51,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:27:51,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:27:51,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:27:51,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145b7d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51, skipping insertion in model container [2025-03-13 21:27:51,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:27:51,867 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/31_simple_loop5_vs.i[30640,30653] [2025-03-13 21:27:51,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:27:51,886 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:27:51,918 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/31_simple_loop5_vs.i[30640,30653] [2025-03-13 21:27:51,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:27:51,951 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:27:51,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51 WrapperNode [2025-03-13 21:27:51,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:27:51,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:27:51,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:27:51,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:27:51,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,981 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-03-13 21:27:51,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:27:51,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:27:51,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:27:51,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:27:51,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,996 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-13 21:27:51,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:51,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:52,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:52,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:27:52,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:27:52,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:27:52,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:27:52,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (1/1) ... [2025-03-13 21:27:52,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:27:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:52,027 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-13 21:27:52,029 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-13 21:27:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-13 21:27:52,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-13 21:27:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:27:52,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:27:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:27:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:27:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:27:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:27:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:27:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:27:52,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:27:52,045 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:27:52,127 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:27:52,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:27:52,213 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:27:52,213 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:27:52,213 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:27:52,285 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:27:52,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:27:52 BoogieIcfgContainer [2025-03-13 21:27:52,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:27:52,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:27:52,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:27:52,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:27:52,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:27:51" (1/3) ... [2025-03-13 21:27:52,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594edf27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:27:52, skipping insertion in model container [2025-03-13 21:27:52,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:51" (2/3) ... [2025-03-13 21:27:52,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594edf27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:27:52, skipping insertion in model container [2025-03-13 21:27:52,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:27:52" (3/3) ... [2025-03-13 21:27:52,293 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-03-13 21:27:52,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:27:52,305 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 22 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-13 21:27:52,305 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:27:52,336 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:52,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 58 flow [2025-03-13 21:27:52,382 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-03-13 21:27:52,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:27:52,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 26 events. 3/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-13 21:27:52,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 58 flow [2025-03-13 21:27:52,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 55 flow [2025-03-13 21:27:52,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:52,399 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;@6df59faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:52,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:27:52,405 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:52,405 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-13 21:27:52,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:27:52,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:52,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:52,406 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-13 21:27:52,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:52,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1951284362, now seen corresponding path program 1 times [2025-03-13 21:27:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76498698] [2025-03-13 21:27:52,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:52,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:52,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:27:52,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:27:52,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:52,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:52,630 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-13 21:27:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:52,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76498698] [2025-03-13 21:27:52,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76498698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:52,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:52,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:52,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226275962] [2025-03-13 21:27:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:52,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:52,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:52,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:52,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-13 21:27:52,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 55 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-13 21:27:52,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:52,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-13 21:27:52,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:52,772 INFO L124 PetriNetUnfolderBase]: 158/310 cut-off events. [2025-03-13 21:27:52,772 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:27:52,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 310 events. 158/310 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1286 event pairs, 50 based on Foata normal form. 9/309 useless extension candidates. Maximal degree in co-relation 571. Up to 134 conditions per place. [2025-03-13 21:27:52,776 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 18 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-03-13 21:27:52,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 105 flow [2025-03-13 21:27:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-13 21:27:52,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066666666666667 [2025-03-13 21:27:52,789 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 55 flow. Second operand 3 states and 53 transitions. [2025-03-13 21:27:52,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 105 flow [2025-03-13 21:27:52,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:52,794 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 68 flow [2025-03-13 21:27:52,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2025-03-13 21:27:52,799 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-03-13 21:27:52,799 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 68 flow [2025-03-13 21:27:52,800 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-13 21:27:52,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:52,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:52,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:27:52,800 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 1 more)] === [2025-03-13 21:27:52,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:52,801 INFO L85 PathProgramCache]: Analyzing trace with hash -340464563, now seen corresponding path program 1 times [2025-03-13 21:27:52,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:52,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968888155] [2025-03-13 21:27:52,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:52,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:52,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:27:52,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:27:52,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:52,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:52,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:52,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:27:52,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:27:52,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:52,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:52,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:52,841 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:52,843 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-13 21:27:52,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-13 21:27:52,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-13 21:27:52,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-13 21:27:52,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:27:52,845 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 21:27:52,848 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:52,848 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:27:52,868 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:52,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 106 flow [2025-03-13 21:27:52,875 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-03-13 21:27:52,876 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:27:52,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 36 events. 4/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2025-03-13 21:27:52,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 106 flow [2025-03-13 21:27:52,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 31 transitions, 75 flow [2025-03-13 21:27:52,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:52,877 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;@6df59faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:52,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:27:52,882 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:52,882 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-13 21:27:52,882 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:27:52,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:52,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:52,882 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-13 21:27:52,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1071220310, now seen corresponding path program 1 times [2025-03-13 21:27:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358621569] [2025-03-13 21:27:52,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:52,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:27:52,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:27:52,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:52,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:52,935 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-13 21:27:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358621569] [2025-03-13 21:27:52,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358621569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:52,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:52,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187229448] [2025-03-13 21:27:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:52,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:52,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:52,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-13 21:27:52,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 75 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-13 21:27:52,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:52,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-13 21:27:52,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:53,156 INFO L124 PetriNetUnfolderBase]: 1203/1934 cut-off events. [2025-03-13 21:27:53,157 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-13 21:27:53,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3719 conditions, 1934 events. 1203/1934 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10052 event pairs, 303 based on Foata normal form. 54/1922 useless extension candidates. Maximal degree in co-relation 3708. Up to 1003 conditions per place. [2025-03-13 21:27:53,169 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 25 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-03-13 21:27:53,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 152 flow [2025-03-13 21:27:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-13 21:27:53,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-13 21:27:53,171 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 75 flow. Second operand 3 states and 81 transitions. [2025-03-13 21:27:53,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 152 flow [2025-03-13 21:27:53,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:53,173 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 94 flow [2025-03-13 21:27:53,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2025-03-13 21:27:53,173 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-03-13 21:27:53,174 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 94 flow [2025-03-13 21:27:53,174 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-13 21:27:53,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:53,176 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:53,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:27:53,176 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-13 21:27:53,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1911255665, now seen corresponding path program 1 times [2025-03-13 21:27:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456318310] [2025-03-13 21:27:53,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:53,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:27:53,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:27:53,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:53,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:53,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:53,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:27:53,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:27:53,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:53,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:53,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:53,209 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:53,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 21:27:53,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-13 21:27:53,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-13 21:27:53,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-13 21:27:53,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-13 21:27:53,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:27:53,209 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 21:27:53,210 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:53,210 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:27:53,228 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:53,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 61 transitions, 158 flow [2025-03-13 21:27:53,235 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-03-13 21:27:53,235 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:27:53,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 46 events. 5/46 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2025-03-13 21:27:53,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 61 transitions, 158 flow [2025-03-13 21:27:53,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 38 transitions, 97 flow [2025-03-13 21:27:53,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:53,238 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;@6df59faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:53,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:27:53,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:53,241 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-13 21:27:53,241 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:27:53,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:53,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:53,241 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-13 21:27:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash -461515354, now seen corresponding path program 1 times [2025-03-13 21:27:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369045406] [2025-03-13 21:27:53,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:53,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:27:53,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:27:53,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:53,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:53,283 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-13 21:27:53,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:53,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369045406] [2025-03-13 21:27:53,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369045406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:53,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:53,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853448839] [2025-03-13 21:27:53,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:53,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:53,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:53,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:53,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-13 21:27:53,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 97 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-13 21:27:53,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:53,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-13 21:27:53,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:53,983 INFO L124 PetriNetUnfolderBase]: 6995/10083 cut-off events. [2025-03-13 21:27:53,983 INFO L125 PetriNetUnfolderBase]: For 1030/1030 co-relation queries the response was YES. [2025-03-13 21:27:54,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19714 conditions, 10083 events. 6995/10083 cut-off events. For 1030/1030 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 57936 event pairs, 1712 based on Foata normal form. 243/10027 useless extension candidates. Maximal degree in co-relation 19702. Up to 5767 conditions per place. [2025-03-13 21:27:54,052 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 32 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-03-13 21:27:54,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 203 flow [2025-03-13 21:27:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-13 21:27:54,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5956284153005464 [2025-03-13 21:27:54,055 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 97 flow. Second operand 3 states and 109 transitions. [2025-03-13 21:27:54,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 203 flow [2025-03-13 21:27:54,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 198 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:54,058 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 120 flow [2025-03-13 21:27:54,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-13 21:27:54,060 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-13 21:27:54,060 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 120 flow [2025-03-13 21:27:54,061 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-13 21:27:54,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:54,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:54,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:27:54,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:27:54,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1242912319, now seen corresponding path program 1 times [2025-03-13 21:27:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52141945] [2025-03-13 21:27:54,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:54,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:27:54,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:27:54,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:54,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:54,143 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-13 21:27:54,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52141945] [2025-03-13 21:27:54,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52141945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:54,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:54,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:54,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399291257] [2025-03-13 21:27:54,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:54,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:54,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:54,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:54,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:54,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 61 [2025-03-13 21:27:54,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-13 21:27:54,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:54,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 61 [2025-03-13 21:27:54,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:54,297 INFO L124 PetriNetUnfolderBase]: 572/1291 cut-off events. [2025-03-13 21:27:54,297 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2025-03-13 21:27:54,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 1291 events. 572/1291 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7828 event pairs, 95 based on Foata normal form. 702/1962 useless extension candidates. Maximal degree in co-relation 2844. Up to 756 conditions per place. [2025-03-13 21:27:54,305 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 20 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2025-03-13 21:27:54,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 201 flow [2025-03-13 21:27:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-13 21:27:54,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2025-03-13 21:27:54,307 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 120 flow. Second operand 3 states and 107 transitions. [2025-03-13 21:27:54,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 201 flow [2025-03-13 21:27:54,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:27:54,309 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 126 flow [2025-03-13 21:27:54,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-13 21:27:54,312 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-13 21:27:54,312 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 126 flow [2025-03-13 21:27:54,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-13 21:27:54,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:54,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:54,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:27:54,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:27:54,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash -397255261, now seen corresponding path program 1 times [2025-03-13 21:27:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:54,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092652570] [2025-03-13 21:27:54,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:54,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:27:54,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:54,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:54,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:54,406 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-13 21:27:54,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092652570] [2025-03-13 21:27:54,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092652570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:54,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:54,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:54,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093005082] [2025-03-13 21:27:54,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:54,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:27:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:54,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:27:54,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:27:54,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-13 21:27:54,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-13 21:27:54,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:54,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-13 21:27:54,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:54,587 INFO L124 PetriNetUnfolderBase]: 971/2115 cut-off events. [2025-03-13 21:27:54,588 INFO L125 PetriNetUnfolderBase]: For 639/639 co-relation queries the response was YES. [2025-03-13 21:27:54,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5299 conditions, 2115 events. 971/2115 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14301 event pairs, 52 based on Foata normal form. 18/2125 useless extension candidates. Maximal degree in co-relation 5285. Up to 1117 conditions per place. [2025-03-13 21:27:54,602 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 43 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2025-03-13 21:27:54,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 356 flow [2025-03-13 21:27:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:27:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:27:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-03-13 21:27:54,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-03-13 21:27:54,606 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 126 flow. Second operand 4 states and 140 transitions. [2025-03-13 21:27:54,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 356 flow [2025-03-13 21:27:54,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:54,611 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 197 flow [2025-03-13 21:27:54,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2025-03-13 21:27:54,612 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-03-13 21:27:54,612 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 197 flow [2025-03-13 21:27:54,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-13 21:27:54,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:54,613 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:27:54,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:27:54,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1153080882, now seen corresponding path program 1 times [2025-03-13 21:27:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:54,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807574120] [2025-03-13 21:27:54,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:54,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:27:54,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:54,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:54,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:54,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:54,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:27:54,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:54,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:54,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:54,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:54,641 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:54,641 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-13 21:27:54,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-13 21:27:54,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-13 21:27:54,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-13 21:27:54,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-13 21:27:54,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-13 21:27:54,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:27:54,641 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 21:27:54,642 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:54,642 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:27:54,671 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:54,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 79 transitions, 214 flow [2025-03-13 21:27:54,679 INFO L124 PetriNetUnfolderBase]: 6/56 cut-off events. [2025-03-13 21:27:54,679 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:27:54,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 56 events. 6/56 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 72. Up to 5 conditions per place. [2025-03-13 21:27:54,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 79 transitions, 214 flow [2025-03-13 21:27:54,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 45 transitions, 121 flow [2025-03-13 21:27:54,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:54,684 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;@6df59faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:54,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 21:27:54,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:54,685 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-13 21:27:54,685 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:27:54,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:54,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:54,685 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-13 21:27:54,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:54,685 INFO L85 PathProgramCache]: Analyzing trace with hash -514568066, now seen corresponding path program 1 times [2025-03-13 21:27:54,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:54,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946490584] [2025-03-13 21:27:54,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:54,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:54,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:27:54,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:27:54,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:54,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:54,710 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-13 21:27:54,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:54,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946490584] [2025-03-13 21:27:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946490584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:54,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576824878] [2025-03-13 21:27:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:54,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:54,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:54,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:54,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:54,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2025-03-13 21:27:54,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 121 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-13 21:27:54,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:54,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2025-03-13 21:27:54,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:56,910 INFO L124 PetriNetUnfolderBase]: 36336/48833 cut-off events. [2025-03-13 21:27:56,911 INFO L125 PetriNetUnfolderBase]: For 7732/7732 co-relation queries the response was YES. [2025-03-13 21:27:57,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96558 conditions, 48833 events. 36336/48833 cut-off events. For 7732/7732 co-relation queries the response was YES. Maximal size of possible extension queue 1800. Compared 292973 event pairs, 9261 based on Foata normal form. 1008/48581 useless extension candidates. Maximal degree in co-relation 96545. Up to 29392 conditions per place. [2025-03-13 21:27:57,240 INFO L140 encePairwiseOnDemand]: 65/79 looper letters, 39 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-03-13 21:27:57,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 258 flow [2025-03-13 21:27:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-13 21:27:57,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5780590717299579 [2025-03-13 21:27:57,241 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 121 flow. Second operand 3 states and 137 transitions. [2025-03-13 21:27:57,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 258 flow [2025-03-13 21:27:57,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 245 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:57,245 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 146 flow [2025-03-13 21:27:57,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-03-13 21:27:57,246 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-13 21:27:57,246 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 146 flow [2025-03-13 21:27:57,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-13 21:27:57,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:57,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:57,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:27:57,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:27:57,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1268658527, now seen corresponding path program 1 times [2025-03-13 21:27:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:57,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532497288] [2025-03-13 21:27:57,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:57,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:27:57,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:27:57,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:57,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:57,303 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-13 21:27:57,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532497288] [2025-03-13 21:27:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532497288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596518828] [2025-03-13 21:27:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:57,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:57,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:57,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:57,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 79 [2025-03-13 21:27:57,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-13 21:27:57,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:57,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 79 [2025-03-13 21:27:57,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:57,517 INFO L124 PetriNetUnfolderBase]: 1534/3267 cut-off events. [2025-03-13 21:27:57,517 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2025-03-13 21:27:57,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7359 conditions, 3267 events. 1534/3267 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 23047 event pairs, 245 based on Foata normal form. 2436/5640 useless extension candidates. Maximal degree in co-relation 7343. Up to 2028 conditions per place. [2025-03-13 21:27:57,539 INFO L140 encePairwiseOnDemand]: 69/79 looper letters, 24 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2025-03-13 21:27:57,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 246 flow [2025-03-13 21:27:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-13 21:27:57,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5780590717299579 [2025-03-13 21:27:57,540 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 146 flow. Second operand 3 states and 137 transitions. [2025-03-13 21:27:57,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 246 flow [2025-03-13 21:27:57,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:27:57,545 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 154 flow [2025-03-13 21:27:57,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-03-13 21:27:57,545 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-13 21:27:57,545 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 154 flow [2025-03-13 21:27:57,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-13 21:27:57,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:57,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:57,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:27:57,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:27:57,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1527315140, now seen corresponding path program 1 times [2025-03-13 21:27:57,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:57,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702228670] [2025-03-13 21:27:57,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:57,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:27:57,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:57,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:57,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:57,598 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-13 21:27:57,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:57,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702228670] [2025-03-13 21:27:57,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702228670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:57,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:57,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:57,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480535080] [2025-03-13 21:27:57,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:57,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:27:57,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:57,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:27:57,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:27:57,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 79 [2025-03-13 21:27:57,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-13 21:27:57,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:57,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 79 [2025-03-13 21:27:57,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:57,926 INFO L124 PetriNetUnfolderBase]: 2452/5005 cut-off events. [2025-03-13 21:27:57,926 INFO L125 PetriNetUnfolderBase]: For 1474/1474 co-relation queries the response was YES. [2025-03-13 21:27:57,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12818 conditions, 5005 events. 2452/5005 cut-off events. For 1474/1474 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 37327 event pairs, 86 based on Foata normal form. 30/5026 useless extension candidates. Maximal degree in co-relation 12803. Up to 3063 conditions per place. [2025-03-13 21:27:57,955 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 53 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2025-03-13 21:27:57,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 81 transitions, 448 flow [2025-03-13 21:27:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:27:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:27:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-03-13 21:27:57,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5664556962025317 [2025-03-13 21:27:57,956 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 154 flow. Second operand 4 states and 179 transitions. [2025-03-13 21:27:57,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 81 transitions, 448 flow [2025-03-13 21:27:57,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:57,960 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 248 flow [2025-03-13 21:27:57,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2025-03-13 21:27:57,960 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2025-03-13 21:27:57,960 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 248 flow [2025-03-13 21:27:57,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-13 21:27:57,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:57,961 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:57,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:27:57,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:27:57,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1359006584, now seen corresponding path program 1 times [2025-03-13 21:27:57,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:57,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915467153] [2025-03-13 21:27:57,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:57,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:57,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:27:57,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:27:57,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:57,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:57,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:57,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:27:57,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:27:57,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:57,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:57,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:57,979 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:57,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-13 21:27:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-13 21:27:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-13 21:27:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-13 21:27:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-13 21:27:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-13 21:27:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-13 21:27:57,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:27:57,979 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 21:27:57,981 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:57,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 21:27:58,005 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:58,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 97 transitions, 274 flow [2025-03-13 21:27:58,011 INFO L124 PetriNetUnfolderBase]: 7/66 cut-off events. [2025-03-13 21:27:58,011 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 21:27:58,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 66 events. 7/66 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 88. Up to 6 conditions per place. [2025-03-13 21:27:58,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 97 transitions, 274 flow [2025-03-13 21:27:58,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 52 transitions, 147 flow [2025-03-13 21:27:58,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:58,013 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;@6df59faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:58,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-13 21:27:58,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:58,014 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-13 21:27:58,014 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:27:58,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:58,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:58,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-13 21:27:58,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1268550646, now seen corresponding path program 1 times [2025-03-13 21:27:58,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:58,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765092378] [2025-03-13 21:27:58,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:58,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:58,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:27:58,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:27:58,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:58,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:58,034 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-13 21:27:58,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:58,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765092378] [2025-03-13 21:27:58,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765092378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:58,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:58,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:58,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489300017] [2025-03-13 21:27:58,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:58,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:58,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:58,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:58,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:58,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-03-13 21:27:58,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-13 21:27:58,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:58,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-03-13 21:27:58,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:28:08,871 INFO L124 PetriNetUnfolderBase]: 178118/228120 cut-off events. [2025-03-13 21:28:08,871 INFO L125 PetriNetUnfolderBase]: For 49465/49465 co-relation queries the response was YES. [2025-03-13 21:28:09,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454639 conditions, 228120 events. 178118/228120 cut-off events. For 49465/49465 co-relation queries the response was YES. Maximal size of possible extension queue 6729. Compared 1408583 event pairs, 48026 based on Foata normal form. 4077/227061 useless extension candidates. Maximal degree in co-relation 454625. Up to 141658 conditions per place. [2025-03-13 21:28:10,233 INFO L140 encePairwiseOnDemand]: 81/97 looper letters, 46 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-03-13 21:28:10,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 317 flow [2025-03-13 21:28:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:28:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:28:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-13 21:28:10,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670103092783505 [2025-03-13 21:28:10,236 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 147 flow. Second operand 3 states and 165 transitions. [2025-03-13 21:28:10,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 317 flow [2025-03-13 21:28:10,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 292 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-13 21:28:10,257 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 172 flow [2025-03-13 21:28:10,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-03-13 21:28:10,259 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-03-13 21:28:10,259 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 172 flow [2025-03-13 21:28:10,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-13 21:28:10,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:10,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:28:10,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:28:10,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-13 21:28:10,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash -261815913, now seen corresponding path program 1 times [2025-03-13 21:28:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:10,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79760802] [2025-03-13 21:28:10,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:10,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:28:10,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:28:10,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:10,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:28:10,306 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-13 21:28:10,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:28:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79760802] [2025-03-13 21:28:10,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79760802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:28:10,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:28:10,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:28:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971761] [2025-03-13 21:28:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:28:10,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:28:10,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:28:10,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:28:10,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:28:10,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 97 [2025-03-13 21:28:10,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-13 21:28:10,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:28:10,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 97 [2025-03-13 21:28:10,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:28:10,801 INFO L124 PetriNetUnfolderBase]: 3820/7826 cut-off events. [2025-03-13 21:28:10,801 INFO L125 PetriNetUnfolderBase]: For 2573/2573 co-relation queries the response was YES. [2025-03-13 21:28:10,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17862 conditions, 7826 events. 3820/7826 cut-off events. For 2573/2573 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 62417 event pairs, 617 based on Foata normal form. 7392/15088 useless extension candidates. Maximal degree in co-relation 17845. Up to 5067 conditions per place. [2025-03-13 21:28:10,847 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 28 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2025-03-13 21:28:10,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 291 flow [2025-03-13 21:28:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:28:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:28:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-03-13 21:28:10,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5738831615120275 [2025-03-13 21:28:10,848 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 172 flow. Second operand 3 states and 167 transitions. [2025-03-13 21:28:10,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 291 flow [2025-03-13 21:28:10,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:28:10,860 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 182 flow [2025-03-13 21:28:10,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-03-13 21:28:10,861 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-03-13 21:28:10,861 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 182 flow [2025-03-13 21:28:10,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-13 21:28:10,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:10,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:28:10,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:28:10,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-13 21:28:10,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1390588613, now seen corresponding path program 1 times [2025-03-13 21:28:10,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:10,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167937347] [2025-03-13 21:28:10,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:10,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:10,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:28:10,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:28:10,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:10,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:28:10,916 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-13 21:28:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:28:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167937347] [2025-03-13 21:28:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167937347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:28:10,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:28:10,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:28:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278280154] [2025-03-13 21:28:10,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:28:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:28:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:28:10,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:28:10,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:28:10,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 97 [2025-03-13 21:28:10,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-13 21:28:10,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:28:10,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 97 [2025-03-13 21:28:10,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:28:11,427 INFO L124 PetriNetUnfolderBase]: 5746/11180 cut-off events. [2025-03-13 21:28:11,427 INFO L125 PetriNetUnfolderBase]: For 3131/3131 co-relation queries the response was YES. [2025-03-13 21:28:11,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29092 conditions, 11180 events. 5746/11180 cut-off events. For 3131/3131 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 89827 event pairs, 162 based on Foata normal form. 45/11212 useless extension candidates. Maximal degree in co-relation 29076. Up to 7677 conditions per place. [2025-03-13 21:28:11,489 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 63 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2025-03-13 21:28:11,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 540 flow [2025-03-13 21:28:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:28:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:28:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2025-03-13 21:28:11,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5618556701030928 [2025-03-13 21:28:11,490 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 182 flow. Second operand 4 states and 218 transitions. [2025-03-13 21:28:11,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 540 flow [2025-03-13 21:28:11,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 96 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:28:11,498 INFO L231 Difference]: Finished difference. Result has 58 places, 65 transitions, 299 flow [2025-03-13 21:28:11,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=58, PETRI_TRANSITIONS=65} [2025-03-13 21:28:11,499 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-13 21:28:11,499 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 65 transitions, 299 flow [2025-03-13 21:28:11,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-13 21:28:11,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:11,499 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:28:11,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:28:11,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-13 21:28:11,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1262282950, now seen corresponding path program 1 times [2025-03-13 21:28:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003872032] [2025-03-13 21:28:11,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:11,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:28:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:28:11,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:11,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:28:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:28:11,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:28:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003872032] [2025-03-13 21:28:11,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003872032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:28:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119198535] [2025-03-13 21:28:11,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:11,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:28:11,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:28:11,602 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-13 21:28:11,603 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-13 21:28:11,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:28:11,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:28:11,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:11,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:28:11,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:28:11,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:28:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:28:11,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:28:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:28:11,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119198535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:28:11,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:28:11,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-13 21:28:11,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76251752] [2025-03-13 21:28:11,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:28:11,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:28:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:28:11,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:28:11,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:28:11,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 97 [2025-03-13 21:28:11,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 65 transitions, 299 flow. Second operand has 11 states, 11 states have (on average 40.54545454545455) internal successors, (446), 11 states have internal predecessors, (446), 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-13 21:28:11,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:28:11,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 97 [2025-03-13 21:28:11,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:28:13,481 INFO L124 PetriNetUnfolderBase]: 14388/27932 cut-off events. [2025-03-13 21:28:13,481 INFO L125 PetriNetUnfolderBase]: For 12468/12472 co-relation queries the response was YES. [2025-03-13 21:28:13,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68976 conditions, 27932 events. 14388/27932 cut-off events. For 12468/12472 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 255860 event pairs, 2531 based on Foata normal form. 171/28090 useless extension candidates. Maximal degree in co-relation 68957. Up to 8691 conditions per place. [2025-03-13 21:28:13,682 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 59 selfloop transitions, 46 changer transitions 0/122 dead transitions. [2025-03-13 21:28:13,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 771 flow [2025-03-13 21:28:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:28:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:28:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2025-03-13 21:28:13,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5381443298969072 [2025-03-13 21:28:13,684 INFO L175 Difference]: Start difference. First operand has 58 places, 65 transitions, 299 flow. Second operand 5 states and 261 transitions. [2025-03-13 21:28:13,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 771 flow [2025-03-13 21:28:13,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 122 transitions, 771 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:28:13,696 INFO L231 Difference]: Finished difference. Result has 63 places, 85 transitions, 543 flow [2025-03-13 21:28:13,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=543, PETRI_PLACES=63, PETRI_TRANSITIONS=85} [2025-03-13 21:28:13,697 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2025-03-13 21:28:13,697 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 85 transitions, 543 flow [2025-03-13 21:28:13,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 40.54545454545455) internal successors, (446), 11 states have internal predecessors, (446), 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-13 21:28:13,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:13,697 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:28:13,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:28:13,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 21:28:13,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-13 21:28:13,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash 68431951, now seen corresponding path program 1 times [2025-03-13 21:28:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:13,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429492006] [2025-03-13 21:28:13,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:13,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:28:13,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:28:13,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:13,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:28:13,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:28:13,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:28:13,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:28:13,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:13,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:28:13,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:28:13,927 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:28:13,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-13 21:28:13,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-13 21:28:13,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-03-13 21:28:13,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-13 21:28:13,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-13 21:28:13,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-13 21:28:13,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-03-13 21:28:13,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-03-13 21:28:13,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:28:13,928 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 21:28:13,928 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:28:13,929 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-13 21:28:13,959 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:28:13,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 338 flow [2025-03-13 21:28:13,965 INFO L124 PetriNetUnfolderBase]: 8/76 cut-off events. [2025-03-13 21:28:13,966 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-13 21:28:13,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 76 events. 8/76 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 147 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 105. Up to 7 conditions per place. [2025-03-13 21:28:13,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 338 flow [2025-03-13 21:28:13,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 59 transitions, 175 flow [2025-03-13 21:28:13,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:28:13,968 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;@6df59faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:28:13,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 21:28:13,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:28:13,969 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-03-13 21:28:13,969 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:28:13,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:13,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:28:13,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-13 21:28:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1590590302, now seen corresponding path program 1 times [2025-03-13 21:28:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182767275] [2025-03-13 21:28:13,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:13,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:13,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:28:13,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:28:13,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:13,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:28:13,993 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-13 21:28:13,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:28:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182767275] [2025-03-13 21:28:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182767275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:28:13,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:28:13,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:28:13,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624238930] [2025-03-13 21:28:13,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:28:13,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:28:13,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:28:13,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:28:13,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:28:14,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 115 [2025-03-13 21:28:14,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-13 21:28:14,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:28:14,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 115 [2025-03-13 21:28:14,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand