./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 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/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-?-735b3cc-m [2025-03-14 00:46:32,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:46:32,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:46:32,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:46:32,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:46:32,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:46:32,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:46:32,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:46:32,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:46:32,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:46:32,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:46:32,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:46:32,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:46:32,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:46:32,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:46:32,492 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:46:32,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:46:32,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:46:32,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:46:32,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:46:32,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:46:32,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:46:32,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:46:32,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:46:32,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:46:32,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:46:32,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:46:32,493 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-14 00:46:32,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:46:32,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:46:32,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:46:32,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:46:32,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:46:32,721 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-14 00:46:33,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3aff03f/ee2d0897a42d4134a933a48183c07d39/FLAG0ee71aab3 [2025-03-14 00:46:34,093 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:46:34,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-03-14 00:46:34,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3aff03f/ee2d0897a42d4134a933a48183c07d39/FLAG0ee71aab3 [2025-03-14 00:46:34,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3aff03f/ee2d0897a42d4134a933a48183c07d39 [2025-03-14 00:46:34,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:46:34,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:46:34,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:46:34,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:46:34,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:46:34,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e0bed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34, skipping insertion in model container [2025-03-14 00:46:34,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:46:34,381 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-14 00:46:34,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:46:34,406 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:46:34,433 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-14 00:46:34,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:46:34,463 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:46:34,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34 WrapperNode [2025-03-14 00:46:34,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:46:34,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:46:34,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:46:34,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:46:34,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,495 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-03-14 00:46:34,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:46:34,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:46:34,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:46:34,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:46:34,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,511 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-14 00:46:34,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:46:34,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:46:34,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:46:34,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:46:34,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (1/1) ... [2025-03-14 00:46:34,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:46:34,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:46:34,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:46:34,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:46:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-14 00:46:34,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-14 00:46:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 00:46:34,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 00:46:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:46:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:46:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:46:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:46:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:46:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:46:34,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:46:34,571 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:46:34,654 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:46:34,655 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:46:34,750 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:46:34,750 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:46:34,750 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:46:34,833 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:46:34,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:46:34 BoogieIcfgContainer [2025-03-14 00:46:34,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:46:34,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:46:34,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:46:34,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:46:34,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:46:34" (1/3) ... [2025-03-14 00:46:34,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b5acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:46:34, skipping insertion in model container [2025-03-14 00:46:34,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:46:34" (2/3) ... [2025-03-14 00:46:34,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b5acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:46:34, skipping insertion in model container [2025-03-14 00:46:34,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:46:34" (3/3) ... [2025-03-14 00:46:34,842 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-03-14 00:46:34,853 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:46:34,854 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-14 00:46:34,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:46:34,893 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:34,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 58 flow [2025-03-14 00:46:34,940 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-03-14 00:46:34,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:46:34,944 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-14 00:46:34,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 58 flow [2025-03-14 00:46:34,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 55 flow [2025-03-14 00:46:34,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:34,962 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;@60ffd38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:34,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:46:34,968 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:34,968 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-14 00:46:34,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:46:34,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:34,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:34,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:46:34,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:34,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1951284362, now seen corresponding path program 1 times [2025-03-14 00:46:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:34,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801149553] [2025-03-14 00:46:34,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:34,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:35,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:35,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:35,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801149553] [2025-03-14 00:46:35,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801149553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:35,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:35,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616346085] [2025-03-14 00:46:35,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:35,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:35,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:35,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:35,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-14 00:46:35,216 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-14 00:46:35,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:35,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-14 00:46:35,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:35,317 INFO L124 PetriNetUnfolderBase]: 158/310 cut-off events. [2025-03-14 00:46:35,318 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:46:35,320 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-14 00:46:35,324 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 18 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-03-14 00:46:35,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 105 flow [2025-03-14 00:46:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-14 00:46:35,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066666666666667 [2025-03-14 00:46:35,334 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 55 flow. Second operand 3 states and 53 transitions. [2025-03-14 00:46:35,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 105 flow [2025-03-14 00:46:35,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:35,338 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 68 flow [2025-03-14 00:46:35,340 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-14 00:46:35,342 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-03-14 00:46:35,342 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 68 flow [2025-03-14 00:46:35,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:35,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:35,343 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:35,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:46:35,343 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-14 00:46:35,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash -340464563, now seen corresponding path program 1 times [2025-03-14 00:46:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543552207] [2025-03-14 00:46:35,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:35,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:46:35,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:46:35,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:35,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:46:35,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:46:35,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:46:35,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:35,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:46:35,383 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:46:35,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-14 00:46:35,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-14 00:46:35,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 00:46:35,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-14 00:46:35,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:46:35,387 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 00:46:35,389 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:46:35,389 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 00:46:35,405 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:35,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 106 flow [2025-03-14 00:46:35,417 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-03-14 00:46:35,417 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:46:35,418 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-14 00:46:35,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 106 flow [2025-03-14 00:46:35,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 31 transitions, 75 flow [2025-03-14 00:46:35,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:35,442 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;@60ffd38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:35,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 00:46:35,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:35,447 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-14 00:46:35,447 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:46:35,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:35,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:35,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 00:46:35,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1071220310, now seen corresponding path program 1 times [2025-03-14 00:46:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:35,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261401728] [2025-03-14 00:46:35,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:35,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:35,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:35,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:35,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:35,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:35,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261401728] [2025-03-14 00:46:35,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261401728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:35,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:35,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748200424] [2025-03-14 00:46:35,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:35,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:35,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:35,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:35,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-14 00:46:35,510 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-14 00:46:35,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:35,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-14 00:46:35,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:35,722 INFO L124 PetriNetUnfolderBase]: 1203/1934 cut-off events. [2025-03-14 00:46:35,722 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-14 00:46:35,728 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-14 00:46:35,737 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 25 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-03-14 00:46:35,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 152 flow [2025-03-14 00:46:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:35,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-14 00:46:35,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-14 00:46:35,740 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 75 flow. Second operand 3 states and 81 transitions. [2025-03-14 00:46:35,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 152 flow [2025-03-14 00:46:35,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:35,741 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 94 flow [2025-03-14 00:46:35,741 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-14 00:46:35,742 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-03-14 00:46:35,742 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 94 flow [2025-03-14 00:46:35,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:35,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:35,743 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:35,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:46:35,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 00:46:35,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1911255665, now seen corresponding path program 1 times [2025-03-14 00:46:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244945152] [2025-03-14 00:46:35,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:35,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:46:35,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:46:35,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:35,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:46:35,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:46:35,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:46:35,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:35,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:46:35,780 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:46:35,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-14 00:46:35,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 00:46:35,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-14 00:46:35,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 00:46:35,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 00:46:35,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:46:35,781 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 00:46:35,781 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:46:35,781 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 00:46:35,799 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:35,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 61 transitions, 158 flow [2025-03-14 00:46:35,804 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-03-14 00:46:35,804 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 00:46:35,804 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-14 00:46:35,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 61 transitions, 158 flow [2025-03-14 00:46:35,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 38 transitions, 97 flow [2025-03-14 00:46:35,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:35,807 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;@60ffd38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:35,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:46:35,809 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:35,809 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-14 00:46:35,809 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:46:35,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:35,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:35,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:46:35,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash -461515354, now seen corresponding path program 1 times [2025-03-14 00:46:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347360614] [2025-03-14 00:46:35,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:35,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:35,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:35,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:35,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:35,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347360614] [2025-03-14 00:46:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347360614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:35,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:35,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:35,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754967461] [2025-03-14 00:46:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:35,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:35,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:35,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:35,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:35,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-14 00:46:35,882 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-14 00:46:35,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:35,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-14 00:46:35,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:36,502 INFO L124 PetriNetUnfolderBase]: 6995/10083 cut-off events. [2025-03-14 00:46:36,502 INFO L125 PetriNetUnfolderBase]: For 1030/1030 co-relation queries the response was YES. [2025-03-14 00:46:36,520 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-14 00:46:36,589 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 32 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-03-14 00:46:36,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 203 flow [2025-03-14 00:46:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-14 00:46:36,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5956284153005464 [2025-03-14 00:46:36,591 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 97 flow. Second operand 3 states and 109 transitions. [2025-03-14 00:46:36,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 203 flow [2025-03-14 00:46:36,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 198 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:36,595 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 120 flow [2025-03-14 00:46:36,596 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-14 00:46:36,596 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-14 00:46:36,597 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 120 flow [2025-03-14 00:46:36,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:36,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:36,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:36,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:46:36,598 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-14 00:46:36,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1242912319, now seen corresponding path program 1 times [2025-03-14 00:46:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:36,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797550025] [2025-03-14 00:46:36,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:36,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:36,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 00:46:36,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 00:46:36,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:36,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:36,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:36,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797550025] [2025-03-14 00:46:36,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797550025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:36,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:36,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:36,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857551654] [2025-03-14 00:46:36,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:36,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:36,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:36,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:36,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:36,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 61 [2025-03-14 00:46:36,679 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-14 00:46:36,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:36,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 61 [2025-03-14 00:46:36,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:36,821 INFO L124 PetriNetUnfolderBase]: 572/1291 cut-off events. [2025-03-14 00:46:36,822 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2025-03-14 00:46:36,830 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-14 00:46:36,839 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 20 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2025-03-14 00:46:36,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 201 flow [2025-03-14 00:46:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-14 00:46:36,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2025-03-14 00:46:36,843 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 120 flow. Second operand 3 states and 107 transitions. [2025-03-14 00:46:36,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 201 flow [2025-03-14 00:46:36,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:46:36,848 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 126 flow [2025-03-14 00:46:36,848 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-14 00:46:36,849 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-14 00:46:36,849 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 126 flow [2025-03-14 00:46:36,849 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-14 00:46:36,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:36,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:36,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:46:36,849 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-14 00:46:36,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash -397255261, now seen corresponding path program 1 times [2025-03-14 00:46:36,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:36,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121566626] [2025-03-14 00:46:36,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:36,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:46:36,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:46:36,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:36,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:36,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121566626] [2025-03-14 00:46:36,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121566626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:36,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:36,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:36,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460560049] [2025-03-14 00:46:36,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:36,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:46:36,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:36,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:46:36,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:46:36,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-14 00:46:36,987 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-14 00:46:36,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:36,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-14 00:46:36,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:37,199 INFO L124 PetriNetUnfolderBase]: 971/2115 cut-off events. [2025-03-14 00:46:37,200 INFO L125 PetriNetUnfolderBase]: For 639/639 co-relation queries the response was YES. [2025-03-14 00:46:37,208 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-14 00:46:37,216 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 43 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2025-03-14 00:46:37,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 356 flow [2025-03-14 00:46:37,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:46:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:46:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-03-14 00:46:37,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-03-14 00:46:37,219 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 126 flow. Second operand 4 states and 140 transitions. [2025-03-14 00:46:37,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 356 flow [2025-03-14 00:46:37,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:37,224 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 197 flow [2025-03-14 00:46:37,224 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-14 00:46:37,225 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-03-14 00:46:37,225 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 197 flow [2025-03-14 00:46:37,226 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-14 00:46:37,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:37,226 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:37,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:46:37,226 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-14 00:46:37,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1153080882, now seen corresponding path program 1 times [2025-03-14 00:46:37,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:37,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834994775] [2025-03-14 00:46:37,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:37,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:46:37,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:46:37,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:37,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:37,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:46:37,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:46:37,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:46:37,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:37,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:37,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:46:37,251 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:46:37,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-14 00:46:37,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-14 00:46:37,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-14 00:46:37,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-14 00:46:37,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-14 00:46:37,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-14 00:46:37,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:46:37,252 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-14 00:46:37,252 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:46:37,252 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 00:46:37,279 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:37,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 79 transitions, 214 flow [2025-03-14 00:46:37,286 INFO L124 PetriNetUnfolderBase]: 6/56 cut-off events. [2025-03-14 00:46:37,286 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 00:46:37,286 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-14 00:46:37,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 79 transitions, 214 flow [2025-03-14 00:46:37,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 45 transitions, 121 flow [2025-03-14 00:46:37,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:37,290 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;@60ffd38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:37,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 00:46:37,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:37,293 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-14 00:46:37,294 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:46:37,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:37,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:37,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:46:37,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -514568066, now seen corresponding path program 1 times [2025-03-14 00:46:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:37,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319885076] [2025-03-14 00:46:37,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:37,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:37,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:37,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:37,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:37,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:37,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319885076] [2025-03-14 00:46:37,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319885076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:37,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:37,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396245627] [2025-03-14 00:46:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:37,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:37,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:37,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:37,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:37,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2025-03-14 00:46:37,352 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-14 00:46:37,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:37,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2025-03-14 00:46:37,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:39,849 INFO L124 PetriNetUnfolderBase]: 36336/48833 cut-off events. [2025-03-14 00:46:39,849 INFO L125 PetriNetUnfolderBase]: For 7732/7732 co-relation queries the response was YES. [2025-03-14 00:46:39,929 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-14 00:46:40,110 INFO L140 encePairwiseOnDemand]: 65/79 looper letters, 39 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-03-14 00:46:40,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 258 flow [2025-03-14 00:46:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-14 00:46:40,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5780590717299579 [2025-03-14 00:46:40,112 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 121 flow. Second operand 3 states and 137 transitions. [2025-03-14 00:46:40,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 258 flow [2025-03-14 00:46:40,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 245 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:40,115 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 146 flow [2025-03-14 00:46:40,116 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-14 00:46:40,116 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-14 00:46:40,116 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 146 flow [2025-03-14 00:46:40,116 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-14 00:46:40,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:40,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:40,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:46:40,117 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-14 00:46:40,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1268658527, now seen corresponding path program 1 times [2025-03-14 00:46:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:40,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10730435] [2025-03-14 00:46:40,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:40,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 00:46:40,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 00:46:40,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:40,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:40,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:40,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10730435] [2025-03-14 00:46:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10730435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:40,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482005808] [2025-03-14 00:46:40,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:40,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:40,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:40,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:40,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 79 [2025-03-14 00:46:40,172 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-14 00:46:40,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:40,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 79 [2025-03-14 00:46:40,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:40,326 INFO L124 PetriNetUnfolderBase]: 1534/3267 cut-off events. [2025-03-14 00:46:40,326 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2025-03-14 00:46:40,334 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-14 00:46:40,342 INFO L140 encePairwiseOnDemand]: 69/79 looper letters, 24 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2025-03-14 00:46:40,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 246 flow [2025-03-14 00:46:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-14 00:46:40,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5780590717299579 [2025-03-14 00:46:40,343 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 146 flow. Second operand 3 states and 137 transitions. [2025-03-14 00:46:40,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 246 flow [2025-03-14 00:46:40,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:46:40,348 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 154 flow [2025-03-14 00:46:40,348 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-14 00:46:40,348 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-14 00:46:40,349 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 154 flow [2025-03-14 00:46:40,349 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-14 00:46:40,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:40,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:40,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:46:40,349 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-14 00:46:40,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1527315140, now seen corresponding path program 1 times [2025-03-14 00:46:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:40,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601708910] [2025-03-14 00:46:40,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:40,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:40,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:46:40,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:46:40,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:40,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:40,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601708910] [2025-03-14 00:46:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601708910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:40,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:40,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522550381] [2025-03-14 00:46:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:40,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:46:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:40,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:46:40,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:46:40,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 79 [2025-03-14 00:46:40,419 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-14 00:46:40,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:40,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 79 [2025-03-14 00:46:40,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:40,789 INFO L124 PetriNetUnfolderBase]: 2452/5005 cut-off events. [2025-03-14 00:46:40,789 INFO L125 PetriNetUnfolderBase]: For 1474/1474 co-relation queries the response was YES. [2025-03-14 00:46:40,803 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-14 00:46:40,823 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 53 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2025-03-14 00:46:40,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 81 transitions, 448 flow [2025-03-14 00:46:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:46:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:46:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-03-14 00:46:40,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5664556962025317 [2025-03-14 00:46:40,824 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 154 flow. Second operand 4 states and 179 transitions. [2025-03-14 00:46:40,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 81 transitions, 448 flow [2025-03-14 00:46:40,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:40,828 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 248 flow [2025-03-14 00:46:40,828 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-14 00:46:40,829 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2025-03-14 00:46:40,829 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 248 flow [2025-03-14 00:46:40,829 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-14 00:46:40,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:40,829 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:40,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 00:46:40,830 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-14 00:46:40,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1359006584, now seen corresponding path program 1 times [2025-03-14 00:46:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:40,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248195715] [2025-03-14 00:46:40,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:40,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 00:46:40,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 00:46:40,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:40,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:40,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:46:40,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 00:46:40,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 00:46:40,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:40,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:40,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:46:40,853 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:46:40,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-14 00:46:40,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-14 00:46:40,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-14 00:46:40,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-14 00:46:40,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-14 00:46:40,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-14 00:46:40,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-14 00:46:40,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 00:46:40,854 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-14 00:46:40,854 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:46:40,855 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-14 00:46:40,885 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:40,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 97 transitions, 274 flow [2025-03-14 00:46:40,893 INFO L124 PetriNetUnfolderBase]: 7/66 cut-off events. [2025-03-14 00:46:40,893 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-14 00:46:40,893 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-14 00:46:40,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 97 transitions, 274 flow [2025-03-14 00:46:40,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 52 transitions, 147 flow [2025-03-14 00:46:40,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:40,895 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;@60ffd38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:40,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-14 00:46:40,896 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:40,897 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-14 00:46:40,897 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:46:40,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:40,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:40,897 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-14 00:46:40,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:40,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1268550646, now seen corresponding path program 1 times [2025-03-14 00:46:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064670416] [2025-03-14 00:46:40,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:40,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:40,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:40,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:40,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:40,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:40,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:40,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064670416] [2025-03-14 00:46:40,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064670416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:40,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:40,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:40,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291805117] [2025-03-14 00:46:40,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:40,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:40,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:40,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:40,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-03-14 00:46:40,938 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-14 00:46:40,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:40,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-03-14 00:46:40,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:52,635 INFO L124 PetriNetUnfolderBase]: 178118/228120 cut-off events. [2025-03-14 00:46:52,636 INFO L125 PetriNetUnfolderBase]: For 49465/49465 co-relation queries the response was YES. [2025-03-14 00:46:53,393 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-14 00:46:54,244 INFO L140 encePairwiseOnDemand]: 81/97 looper letters, 46 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-03-14 00:46:54,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 317 flow [2025-03-14 00:46:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-14 00:46:54,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670103092783505 [2025-03-14 00:46:54,246 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 147 flow. Second operand 3 states and 165 transitions. [2025-03-14 00:46:54,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 317 flow [2025-03-14 00:46:54,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 292 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:54,274 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 172 flow [2025-03-14 00:46:54,274 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-14 00:46:54,274 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-03-14 00:46:54,275 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 172 flow [2025-03-14 00:46:54,275 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-14 00:46:54,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:54,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:54,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 00:46:54,275 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-14 00:46:54,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash -261815913, now seen corresponding path program 1 times [2025-03-14 00:46:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118753643] [2025-03-14 00:46:54,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:54,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 00:46:54,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 00:46:54,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:54,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:54,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:54,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118753643] [2025-03-14 00:46:54,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118753643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:54,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:54,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461552918] [2025-03-14 00:46:54,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:54,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:54,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:54,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:54,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 97 [2025-03-14 00:46:54,311 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-14 00:46:54,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:54,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 97 [2025-03-14 00:46:54,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:54,657 INFO L124 PetriNetUnfolderBase]: 3820/7826 cut-off events. [2025-03-14 00:46:54,657 INFO L125 PetriNetUnfolderBase]: For 2573/2573 co-relation queries the response was YES. [2025-03-14 00:46:54,683 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-14 00:46:54,711 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 28 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2025-03-14 00:46:54,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 291 flow [2025-03-14 00:46:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-03-14 00:46:54,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5738831615120275 [2025-03-14 00:46:54,713 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 172 flow. Second operand 3 states and 167 transitions. [2025-03-14 00:46:54,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 291 flow [2025-03-14 00:46:54,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:46:54,864 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 182 flow [2025-03-14 00:46:54,864 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-14 00:46:54,864 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-03-14 00:46:54,865 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 182 flow [2025-03-14 00:46:54,865 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-14 00:46:54,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:54,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:54,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 00:46:54,866 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-14 00:46:54,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1390588613, now seen corresponding path program 1 times [2025-03-14 00:46:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053008194] [2025-03-14 00:46:54,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:54,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:46:54,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:46:54,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:54,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:54,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:54,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053008194] [2025-03-14 00:46:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053008194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:54,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:54,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887443040] [2025-03-14 00:46:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:54,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:46:54,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:54,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:46:54,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:46:54,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 97 [2025-03-14 00:46:54,965 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-14 00:46:54,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:54,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 97 [2025-03-14 00:46:54,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:55,547 INFO L124 PetriNetUnfolderBase]: 5746/11180 cut-off events. [2025-03-14 00:46:55,548 INFO L125 PetriNetUnfolderBase]: For 3131/3131 co-relation queries the response was YES. [2025-03-14 00:46:55,597 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-14 00:46:55,648 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 63 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2025-03-14 00:46:55,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 540 flow [2025-03-14 00:46:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:46:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:46:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2025-03-14 00:46:55,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5618556701030928 [2025-03-14 00:46:55,650 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 182 flow. Second operand 4 states and 218 transitions. [2025-03-14 00:46:55,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 540 flow [2025-03-14 00:46:55,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 96 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:55,659 INFO L231 Difference]: Finished difference. Result has 58 places, 65 transitions, 299 flow [2025-03-14 00:46:55,660 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-14 00:46:55,660 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-14 00:46:55,660 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 65 transitions, 299 flow [2025-03-14 00:46:55,661 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-14 00:46:55,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:55,661 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:55,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 00:46:55,661 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-14 00:46:55,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:55,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1262282950, now seen corresponding path program 1 times [2025-03-14 00:46:55,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:55,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874894053] [2025-03-14 00:46:55,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:55,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:46:55,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:46:55,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:55,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:55,736 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-14 00:46:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:55,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874894053] [2025-03-14 00:46:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874894053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:46:55,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462693809] [2025-03-14 00:46:55,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:55,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:46:55,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:46:55,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:46:55,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:46:55,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:46:55,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:46:55,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:55,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:55,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 00:46:55,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:46:55,927 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-14 00:46:55,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:46:55,976 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-14 00:46:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462693809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:46:55,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:46:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-14 00:46:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639815297] [2025-03-14 00:46:55,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:46:55,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 00:46:55,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:55,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 00:46:55,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 00:46:56,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 97 [2025-03-14 00:46:56,092 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-14 00:46:56,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:56,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 97 [2025-03-14 00:46:56,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:58,118 INFO L124 PetriNetUnfolderBase]: 14388/27932 cut-off events. [2025-03-14 00:46:58,118 INFO L125 PetriNetUnfolderBase]: For 12468/12472 co-relation queries the response was YES. [2025-03-14 00:46:58,216 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-14 00:46:58,322 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 59 selfloop transitions, 46 changer transitions 0/122 dead transitions. [2025-03-14 00:46:58,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 771 flow [2025-03-14 00:46:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:46:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:46:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2025-03-14 00:46:58,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5381443298969072 [2025-03-14 00:46:58,323 INFO L175 Difference]: Start difference. First operand has 58 places, 65 transitions, 299 flow. Second operand 5 states and 261 transitions. [2025-03-14 00:46:58,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 771 flow [2025-03-14 00:46:58,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 122 transitions, 771 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:46:58,336 INFO L231 Difference]: Finished difference. Result has 63 places, 85 transitions, 543 flow [2025-03-14 00:46:58,336 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-14 00:46:58,336 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2025-03-14 00:46:58,336 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 85 transitions, 543 flow [2025-03-14 00:46:58,337 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-14 00:46:58,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:58,337 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:58,344 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-14 00:46:58,541 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-14 00:46:58,541 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-14 00:46:58,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:58,542 INFO L85 PathProgramCache]: Analyzing trace with hash 68431951, now seen corresponding path program 1 times [2025-03-14 00:46:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:58,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991550237] [2025-03-14 00:46:58,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:58,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:58,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:46:58,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:46:58,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:58,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:58,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:46:58,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:46:58,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:46:58,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:58,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:58,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:46:58,576 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:46:58,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-14 00:46:58,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-14 00:46:58,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-03-14 00:46:58,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-14 00:46:58,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-14 00:46:58,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-14 00:46:58,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-03-14 00:46:58,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-03-14 00:46:58,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 00:46:58,577 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-14 00:46:58,577 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:46:58,577 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-14 00:46:58,612 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:58,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 338 flow [2025-03-14 00:46:58,618 INFO L124 PetriNetUnfolderBase]: 8/76 cut-off events. [2025-03-14 00:46:58,618 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-14 00:46:58,618 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-14 00:46:58,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 338 flow [2025-03-14 00:46:58,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 59 transitions, 175 flow [2025-03-14 00:46:58,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:58,620 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;@60ffd38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:58,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-14 00:46:58,621 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:58,621 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-03-14 00:46:58,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:46:58,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:58,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:58,622 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-14 00:46:58,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1590590302, now seen corresponding path program 1 times [2025-03-14 00:46:58,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:58,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931354561] [2025-03-14 00:46:58,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:58,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:58,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:46:58,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:46:58,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:58,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:58,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:58,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931354561] [2025-03-14 00:46:58,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931354561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:58,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:58,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350586813] [2025-03-14 00:46:58,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:58,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:58,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:58,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:58,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:58,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 115 [2025-03-14 00:46:58,657 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-14 00:46:58,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:58,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 115 [2025-03-14 00:46:58,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand