./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-theta/unwind3-100.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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:30:45,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:30:45,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:30:45,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:30:45,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:30:45,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:30:45,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:30:45,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:30:45,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:30:45,203 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:30:45,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:30:45,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:30:45,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:30:45,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:30:45,203 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:30:45,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:30:45,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:30:45,203 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:30:45,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:30:45,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:30:45,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:30:45,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:30:45,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:30:45,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:30:45,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:30:45,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:30:45,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:30:45,205 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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-03-04 02:30:45,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:30:45,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:30:45,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:30:45,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:30:45,425 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:30:45,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-03-04 02:30:46,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5a0abdc2/de76bea42b4842c49a0cca24d9fb16e5/FLAG56e182002 [2025-03-04 02:30:46,827 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:30:46,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-03-04 02:30:46,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5a0abdc2/de76bea42b4842c49a0cca24d9fb16e5/FLAG56e182002 [2025-03-04 02:30:46,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5a0abdc2/de76bea42b4842c49a0cca24d9fb16e5 [2025-03-04 02:30:46,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:30:46,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:30:46,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:30:46,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:30:46,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:30:46,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:30:46" (1/1) ... [2025-03-04 02:30:46,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153ab605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:46, skipping insertion in model container [2025-03-04 02:30:46,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:30:46" (1/1) ... [2025-03-04 02:30:46,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:30:47,132 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-theta/unwind3-100.i[33026,33039] [2025-03-04 02:30:47,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:30:47,155 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:30:47,192 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-theta/unwind3-100.i[33026,33039] [2025-03-04 02:30:47,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:30:47,226 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:30:47,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47 WrapperNode [2025-03-04 02:30:47,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:30:47,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:30:47,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:30:47,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:30:47,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,253 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-03-04 02:30:47,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:30:47,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:30:47,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:30:47,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:30:47,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,270 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:30:47,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,273 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:30:47,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:30:47,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:30:47,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:30:47,280 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (1/1) ... [2025-03-04 02:30:47,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:30:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:47,313 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-04 02:30:47,316 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-04 02:30:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:30:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 02:30:47,334 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 02:30:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 02:30:47,335 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 02:30:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:30:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:30:47,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:30:47,336 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:30:47,418 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:30:47,419 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:30:47,517 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:30:47,517 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:30:47,580 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:30:47,580 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:30:47,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:30:47 BoogieIcfgContainer [2025-03-04 02:30:47,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:30:47,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:30:47,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:30:47,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:30:47,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:30:46" (1/3) ... [2025-03-04 02:30:47,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eabe10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:30:47, skipping insertion in model container [2025-03-04 02:30:47,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:47" (2/3) ... [2025-03-04 02:30:47,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eabe10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:30:47, skipping insertion in model container [2025-03-04 02:30:47,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:30:47" (3/3) ... [2025-03-04 02:30:47,587 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-03-04 02:30:47,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:30:47,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:30:47,598 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:30:47,628 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:30:47,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 52 flow [2025-03-04 02:30:47,681 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-03-04 02:30:47,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:30:47,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 4/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2025-03-04 02:30:47,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 22 transitions, 52 flow [2025-03-04 02:30:47,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 43 flow [2025-03-04 02:30:47,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:47,707 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;@32853ddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:47,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:30:47,719 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:47,720 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-03-04 02:30:47,720 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:30:47,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:47,721 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:47,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:30:47,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:47,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1858627319, now seen corresponding path program 1 times [2025-03-04 02:30:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:47,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478061991] [2025-03-04 02:30:47,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:47,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:47,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:30:47,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:30:47,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:47,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:47,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:30:47,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:30:47,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:30:47,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:47,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:47,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:30:47,850 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:30:47,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-04 02:30:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-04 02:30:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-04 02:30:47,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-04 02:30:47,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:30:47,853 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-04 02:30:47,858 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:30:47,858 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:30:47,883 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:30:47,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 90 flow [2025-03-04 02:30:47,904 INFO L124 PetriNetUnfolderBase]: 6/50 cut-off events. [2025-03-04 02:30:47,904 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:30:47,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 50 events. 6/50 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 112 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 61. Up to 6 conditions per place. [2025-03-04 02:30:47,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 90 flow [2025-03-04 02:30:47,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 57 flow [2025-03-04 02:30:47,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:47,906 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;@32853ddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:47,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:30:47,916 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:47,918 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-03-04 02:30:47,918 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:30:47,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:47,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:47,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:30:47,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:47,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1970234251, now seen corresponding path program 1 times [2025-03-04 02:30:47,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:47,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633710788] [2025-03-04 02:30:47,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:47,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:47,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:30:47,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:30:47,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:47,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:48,073 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-04 02:30:48,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:48,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633710788] [2025-03-04 02:30:48,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633710788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:48,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:48,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:48,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926354732] [2025-03-04 02:30:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:48,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:48,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:48,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:48,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:48,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-04 02:30:48,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-04 02:30:48,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:48,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-04 02:30:48,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:48,258 INFO L124 PetriNetUnfolderBase]: 335/611 cut-off events. [2025-03-04 02:30:48,259 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 02:30:48,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 611 events. 335/611 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2602 event pairs, 148 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 376. Up to 533 conditions per place. [2025-03-04 02:30:48,269 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-03-04 02:30:48,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 115 flow [2025-03-04 02:30:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:30:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:30:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-04 02:30:48,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2025-03-04 02:30:48,280 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 57 flow. Second operand 4 states and 57 transitions. [2025-03-04 02:30:48,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 115 flow [2025-03-04 02:30:48,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:48,288 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 70 flow [2025-03-04 02:30:48,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-03-04 02:30:48,292 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2025-03-04 02:30:48,292 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 70 flow [2025-03-04 02:30:48,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-04 02:30:48,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:48,293 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:48,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:30:48,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:30:48,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:48,294 INFO L85 PathProgramCache]: Analyzing trace with hash 244001453, now seen corresponding path program 1 times [2025-03-04 02:30:48,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:48,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037206393] [2025-03-04 02:30:48,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:48,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:48,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:30:48,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:30:48,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:48,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:48,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:30:48,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:30:48,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:30:48,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:48,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:48,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:30:48,319 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:30:48,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 02:30:48,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-03-04 02:30:48,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-04 02:30:48,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-04 02:30:48,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-04 02:30:48,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:30:48,319 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:30:48,320 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:30:48,320 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 02:30:48,345 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:30:48,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 132 flow [2025-03-04 02:30:48,352 INFO L124 PetriNetUnfolderBase]: 8/67 cut-off events. [2025-03-04 02:30:48,353 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:30:48,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 67 events. 8/67 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 181 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 84. Up to 8 conditions per place. [2025-03-04 02:30:48,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 132 flow [2025-03-04 02:30:48,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 73 flow [2025-03-04 02:30:48,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:48,357 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;@32853ddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:48,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:30:48,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:48,360 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-03-04 02:30:48,360 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:30:48,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:48,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:48,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:48,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 303991665, now seen corresponding path program 1 times [2025-03-04 02:30:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837234219] [2025-03-04 02:30:48,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:48,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:30:48,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:30:48,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:48,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:48,418 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-04 02:30:48,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:48,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837234219] [2025-03-04 02:30:48,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837234219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:48,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:48,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834694722] [2025-03-04 02:30:48,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:48,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:48,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:48,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:48,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:48,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-04 02:30:48,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-04 02:30:48,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:48,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-04 02:30:48,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:48,662 INFO L124 PetriNetUnfolderBase]: 1983/2951 cut-off events. [2025-03-04 02:30:48,662 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2025-03-04 02:30:48,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6030 conditions, 2951 events. 1983/2951 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13121 event pairs, 1188 based on Foata normal form. 0/2699 useless extension candidates. Maximal degree in co-relation 2012. Up to 2821 conditions per place. [2025-03-04 02:30:48,679 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 25 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-03-04 02:30:48,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 139 flow [2025-03-04 02:30:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:30:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:30:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-03-04 02:30:48,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3802083333333333 [2025-03-04 02:30:48,682 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 73 flow. Second operand 4 states and 73 transitions. [2025-03-04 02:30:48,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 139 flow [2025-03-04 02:30:48,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 136 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:48,686 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 84 flow [2025-03-04 02:30:48,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2025-03-04 02:30:48,687 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-04 02:30:48,687 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 84 flow [2025-03-04 02:30:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-04 02:30:48,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:48,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:30:48,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:48,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash -320795183, now seen corresponding path program 1 times [2025-03-04 02:30:48,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:48,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108887972] [2025-03-04 02:30:48,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:48,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:48,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:30:48,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:30:48,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:48,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:48,803 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-04 02:30:48,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:48,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108887972] [2025-03-04 02:30:48,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108887972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:48,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:48,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:48,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737118866] [2025-03-04 02:30:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:48,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:30:48,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:48,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:30:48,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:30:48,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-04 02:30:48,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:48,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:48,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-04 02:30:48,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:49,204 INFO L124 PetriNetUnfolderBase]: 3261/4725 cut-off events. [2025-03-04 02:30:49,204 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2025-03-04 02:30:49,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9744 conditions, 4725 events. 3261/4725 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 22022 event pairs, 2241 based on Foata normal form. 168/4557 useless extension candidates. Maximal degree in co-relation 9702. Up to 3420 conditions per place. [2025-03-04 02:30:49,222 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 32 selfloop transitions, 3 changer transitions 11/49 dead transitions. [2025-03-04 02:30:49,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 220 flow [2025-03-04 02:30:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:30:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:30:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-04 02:30:49,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 02:30:49,224 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 84 flow. Second operand 5 states and 96 transitions. [2025-03-04 02:30:49,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 220 flow [2025-03-04 02:30:49,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:30:49,226 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 96 flow [2025-03-04 02:30:49,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2025-03-04 02:30:49,228 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-04 02:30:49,228 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 96 flow [2025-03-04 02:30:49,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:49,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:49,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:49,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:30:49,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:49,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1354746628, now seen corresponding path program 1 times [2025-03-04 02:30:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972549273] [2025-03-04 02:30:49,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:49,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:30:49,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:30:49,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:49,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:30:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:49,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972549273] [2025-03-04 02:30:49,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972549273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:49,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:49,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:49,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211025843] [2025-03-04 02:30:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:49,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:30:49,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:49,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:30:49,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:30:49,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-04 02:30:49,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-04 02:30:49,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:49,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-04 02:30:49,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:49,540 INFO L124 PetriNetUnfolderBase]: 2362/3610 cut-off events. [2025-03-04 02:30:49,540 INFO L125 PetriNetUnfolderBase]: For 787/787 co-relation queries the response was YES. [2025-03-04 02:30:49,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8273 conditions, 3610 events. 2362/3610 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17300 event pairs, 768 based on Foata normal form. 4/3454 useless extension candidates. Maximal degree in co-relation 7880. Up to 3290 conditions per place. [2025-03-04 02:30:49,556 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 33 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-03-04 02:30:49,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 196 flow [2025-03-04 02:30:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:30:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:30:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-03-04 02:30:49,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-03-04 02:30:49,559 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 96 flow. Second operand 5 states and 92 transitions. [2025-03-04 02:30:49,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 196 flow [2025-03-04 02:30:49,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 188 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:30:49,571 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 106 flow [2025-03-04 02:30:49,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2025-03-04 02:30:49,573 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2025-03-04 02:30:49,573 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 106 flow [2025-03-04 02:30:49,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-04 02:30:49,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:49,573 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:49,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:30:49,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:49,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash -49712440, now seen corresponding path program 1 times [2025-03-04 02:30:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977816951] [2025-03-04 02:30:49,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:49,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:30:49,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:30:49,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:49,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:49,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:30:49,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:30:49,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:30:49,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:49,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:49,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:30:49,601 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:30:49,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 02:30:49,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-03-04 02:30:49,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-04 02:30:49,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-04 02:30:49,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-04 02:30:49,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-04 02:30:49,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:30:49,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 02:30:49,602 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:30:49,602 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 02:30:49,625 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:30:49,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 178 flow [2025-03-04 02:30:49,630 INFO L124 PetriNetUnfolderBase]: 10/84 cut-off events. [2025-03-04 02:30:49,630 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 02:30:49,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 84 events. 10/84 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 229 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 108. Up to 10 conditions per place. [2025-03-04 02:30:49,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 61 transitions, 178 flow [2025-03-04 02:30:49,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 30 transitions, 91 flow [2025-03-04 02:30:49,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:49,631 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;@32853ddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:49,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:30:49,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:49,634 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-03-04 02:30:49,634 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:30:49,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:49,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:49,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 02:30:49,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash 774828538, now seen corresponding path program 1 times [2025-03-04 02:30:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:49,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329371421] [2025-03-04 02:30:49,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:49,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:30:49,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:30:49,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:49,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:49,677 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-04 02:30:49,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:49,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329371421] [2025-03-04 02:30:49,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329371421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:49,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:49,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743654132] [2025-03-04 02:30:49,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:49,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:49,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:49,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:49,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:49,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2025-03-04 02:30:49,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-04 02:30:49,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:49,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2025-03-04 02:30:49,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:50,351 INFO L124 PetriNetUnfolderBase]: 10495/14251 cut-off events. [2025-03-04 02:30:50,353 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2025-03-04 02:30:50,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29235 conditions, 14251 events. 10495/14251 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 67672 event pairs, 7268 based on Foata normal form. 0/13231 useless extension candidates. Maximal degree in co-relation 10176. Up to 13893 conditions per place. [2025-03-04 02:30:50,425 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 29 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-03-04 02:30:50,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 165 flow [2025-03-04 02:30:50,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:30:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:30:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-04 02:30:50,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36475409836065575 [2025-03-04 02:30:50,427 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 91 flow. Second operand 4 states and 89 transitions. [2025-03-04 02:30:50,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 165 flow [2025-03-04 02:30:50,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 158 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:50,434 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 98 flow [2025-03-04 02:30:50,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2025-03-04 02:30:50,437 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-03-04 02:30:50,437 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 98 flow [2025-03-04 02:30:50,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-04 02:30:50,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:50,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:50,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:30:50,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 02:30:50,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash 82925042, now seen corresponding path program 1 times [2025-03-04 02:30:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:50,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935566652] [2025-03-04 02:30:50,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:50,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:50,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:30:50,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:30:50,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:50,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:50,534 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-04 02:30:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935566652] [2025-03-04 02:30:50,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935566652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:50,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:50,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978332058] [2025-03-04 02:30:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:50,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:30:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:50,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:30:50,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:30:50,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 61 [2025-03-04 02:30:50,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:50,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:50,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 61 [2025-03-04 02:30:50,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:51,566 INFO L124 PetriNetUnfolderBase]: 17149/22841 cut-off events. [2025-03-04 02:30:51,567 INFO L125 PetriNetUnfolderBase]: For 1058/1058 co-relation queries the response was YES. [2025-03-04 02:30:51,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47061 conditions, 22841 events. 17149/22841 cut-off events. For 1058/1058 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 111627 event pairs, 12033 based on Foata normal form. 680/22161 useless extension candidates. Maximal degree in co-relation 47018. Up to 16796 conditions per place. [2025-03-04 02:30:51,649 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 39 selfloop transitions, 3 changer transitions 14/59 dead transitions. [2025-03-04 02:30:51,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 266 flow [2025-03-04 02:30:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:30:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:30:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-03-04 02:30:51,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39672131147540984 [2025-03-04 02:30:51,651 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 98 flow. Second operand 5 states and 121 transitions. [2025-03-04 02:30:51,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 266 flow [2025-03-04 02:30:51,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:30:51,653 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 110 flow [2025-03-04 02:30:51,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2025-03-04 02:30:51,653 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2025-03-04 02:30:51,653 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 110 flow [2025-03-04 02:30:51,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:51,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:51,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:51,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:30:51,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 02:30:51,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1724321469, now seen corresponding path program 1 times [2025-03-04 02:30:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:51,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036525700] [2025-03-04 02:30:51,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:51,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:30:51,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:30:51,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:51,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:30:51,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:51,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036525700] [2025-03-04 02:30:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036525700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:51,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888657512] [2025-03-04 02:30:51,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:51,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:30:51,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:51,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:30:51,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:30:51,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2025-03-04 02:30:51,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-04 02:30:51,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:51,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2025-03-04 02:30:51,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:52,549 INFO L124 PetriNetUnfolderBase]: 12666/17338 cut-off events. [2025-03-04 02:30:52,549 INFO L125 PetriNetUnfolderBase]: For 3779/3779 co-relation queries the response was YES. [2025-03-04 02:30:52,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39314 conditions, 17338 events. 12666/17338 cut-off events. For 3779/3779 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 85701 event pairs, 5952 based on Foata normal form. 4/16670 useless extension candidates. Maximal degree in co-relation 38440. Up to 16666 conditions per place. [2025-03-04 02:30:52,657 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 37 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-03-04 02:30:52,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 218 flow [2025-03-04 02:30:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:30:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:30:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-04 02:30:52,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3639344262295082 [2025-03-04 02:30:52,659 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 110 flow. Second operand 5 states and 111 transitions. [2025-03-04 02:30:52,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 218 flow [2025-03-04 02:30:52,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 210 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:30:52,695 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 120 flow [2025-03-04 02:30:52,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-04 02:30:52,696 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2025-03-04 02:30:52,696 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 120 flow [2025-03-04 02:30:52,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-04 02:30:52,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:52,696 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:30:52,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 02:30:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1409091644, now seen corresponding path program 1 times [2025-03-04 02:30:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:52,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389182666] [2025-03-04 02:30:52,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:52,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:52,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:30:52,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:30:52,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:52,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:30:52,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389182666] [2025-03-04 02:30:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389182666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:52,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:52,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:30:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383930176] [2025-03-04 02:30:52,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:52,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:30:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:52,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:30:52,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:30:52,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2025-03-04 02:30:52,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-04 02:30:52,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:52,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2025-03-04 02:30:52,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:53,472 INFO L124 PetriNetUnfolderBase]: 12370/17682 cut-off events. [2025-03-04 02:30:53,472 INFO L125 PetriNetUnfolderBase]: For 2674/2674 co-relation queries the response was YES. [2025-03-04 02:30:53,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38119 conditions, 17682 events. 12370/17682 cut-off events. For 2674/2674 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 96809 event pairs, 3072 based on Foata normal form. 16/17058 useless extension candidates. Maximal degree in co-relation 16925. Up to 15986 conditions per place. [2025-03-04 02:30:53,550 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 47 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-03-04 02:30:53,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 272 flow [2025-03-04 02:30:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:30:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:30:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-04 02:30:53,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37158469945355194 [2025-03-04 02:30:53,551 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 120 flow. Second operand 6 states and 136 transitions. [2025-03-04 02:30:53,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 272 flow [2025-03-04 02:30:53,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 02:30:53,574 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 134 flow [2025-03-04 02:30:53,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-03-04 02:30:53,574 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-03-04 02:30:53,574 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 134 flow [2025-03-04 02:30:53,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-04 02:30:53,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:53,575 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:53,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:30:53,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 02:30:53,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash -595132369, now seen corresponding path program 1 times [2025-03-04 02:30:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567024972] [2025-03-04 02:30:53,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:53,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:30:53,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:30:53,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:53,586 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:30:53,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:30:53,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:30:53,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:53,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:53,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:30:53,599 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:30:53,599 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-04 02:30:53,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-03-04 02:30:53,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-03-04 02:30:53,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-04 02:30:53,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-04 02:30:53,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-04 02:30:53,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-04 02:30:53,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:30:53,600 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 02:30:53,601 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:30:53,601 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 02:30:53,633 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:30:53,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 74 transitions, 228 flow [2025-03-04 02:30:53,638 INFO L124 PetriNetUnfolderBase]: 12/101 cut-off events. [2025-03-04 02:30:53,639 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 02:30:53,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 101 events. 12/101 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 292 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 133. Up to 12 conditions per place. [2025-03-04 02:30:53,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 74 transitions, 228 flow [2025-03-04 02:30:53,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 34 transitions, 111 flow [2025-03-04 02:30:53,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:53,641 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;@32853ddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:53,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 02:30:53,642 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:53,642 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-03-04 02:30:53,642 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:30:53,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:53,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:53,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:30:53,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash -558216176, now seen corresponding path program 1 times [2025-03-04 02:30:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:53,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889626507] [2025-03-04 02:30:53,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:53,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:30:53,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:30:53,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:53,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:53,812 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-04 02:30:53,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:53,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889626507] [2025-03-04 02:30:53,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889626507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:53,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:53,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:53,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143717113] [2025-03-04 02:30:53,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:53,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:53,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:53,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:53,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:53,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 74 [2025-03-04 02:30:53,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:53,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:53,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 74 [2025-03-04 02:30:53,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:56,285 INFO L124 PetriNetUnfolderBase]: 52223/67131 cut-off events. [2025-03-04 02:30:56,285 INFO L125 PetriNetUnfolderBase]: For 7288/7288 co-relation queries the response was YES. [2025-03-04 02:30:56,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137668 conditions, 67131 events. 52223/67131 cut-off events. For 7288/7288 co-relation queries the response was YES. Maximal size of possible extension queue 1661. Compared 335972 event pairs, 39268 based on Foata normal form. 0/63039 useless extension candidates. Maximal degree in co-relation 49232. Up to 65861 conditions per place. [2025-03-04 02:30:56,582 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 33 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-03-04 02:30:56,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 193 flow [2025-03-04 02:30:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:30:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:30:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-04 02:30:56,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3547297297297297 [2025-03-04 02:30:56,583 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 111 flow. Second operand 4 states and 105 transitions. [2025-03-04 02:30:56,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 193 flow [2025-03-04 02:30:56,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 180 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:56,638 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 112 flow [2025-03-04 02:30:56,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2025-03-04 02:30:56,638 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2025-03-04 02:30:56,639 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 112 flow [2025-03-04 02:30:56,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:56,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:56,639 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:56,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:30:56,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:30:56,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash 215599571, now seen corresponding path program 1 times [2025-03-04 02:30:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288414437] [2025-03-04 02:30:56,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:56,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:30:56,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:30:56,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:56,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:56,828 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-04 02:30:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:56,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288414437] [2025-03-04 02:30:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288414437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:56,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:56,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500187998] [2025-03-04 02:30:56,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:56,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:30:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:56,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:30:56,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:30:56,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 74 [2025-03-04 02:30:56,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-04 02:30:56,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:56,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 74 [2025-03-04 02:30:56,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:01,025 INFO L124 PetriNetUnfolderBase]: 84989/107593 cut-off events. [2025-03-04 02:31:01,025 INFO L125 PetriNetUnfolderBase]: For 5023/5023 co-relation queries the response was YES. [2025-03-04 02:31:01,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220902 conditions, 107593 events. 84989/107593 cut-off events. For 5023/5023 co-relation queries the response was YES. Maximal size of possible extension queue 2330. Compared 548570 event pairs, 60417 based on Foata normal form. 2728/104865 useless extension candidates. Maximal degree in co-relation 162916. Up to 79516 conditions per place. [2025-03-04 02:31:01,530 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 46 selfloop transitions, 3 changer transitions 17/69 dead transitions. [2025-03-04 02:31:01,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 312 flow [2025-03-04 02:31:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:31:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:31:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-04 02:31:01,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3945945945945946 [2025-03-04 02:31:01,532 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 112 flow. Second operand 5 states and 146 transitions. [2025-03-04 02:31:01,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 312 flow [2025-03-04 02:31:01,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:31:01,540 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 124 flow [2025-03-04 02:31:01,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2025-03-04 02:31:01,540 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2025-03-04 02:31:01,540 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 124 flow [2025-03-04 02:31:01,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-04 02:31:01,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:01,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:01,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:31:01,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:31:01,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:01,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1906378305, now seen corresponding path program 1 times [2025-03-04 02:31:01,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:01,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145730650] [2025-03-04 02:31:01,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:31:01,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:01,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:31:01,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:31:01,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:31:01,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:31:01,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:01,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145730650] [2025-03-04 02:31:01,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145730650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:31:01,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:31:01,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:31:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449702093] [2025-03-04 02:31:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:31:01,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:31:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:01,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:31:01,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:31:01,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 74 [2025-03-04 02:31:01,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-04 02:31:01,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:01,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 74 [2025-03-04 02:31:01,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:05,082 INFO L124 PetriNetUnfolderBase]: 63098/80842 cut-off events. [2025-03-04 02:31:05,082 INFO L125 PetriNetUnfolderBase]: For 16899/16899 co-relation queries the response was YES. [2025-03-04 02:31:05,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180963 conditions, 80842 events. 63098/80842 cut-off events. For 16899/16899 co-relation queries the response was YES. Maximal size of possible extension queue 1821. Compared 407240 event pairs, 35904 based on Foata normal form. 4/78126 useless extension candidates. Maximal degree in co-relation 179128. Up to 79386 conditions per place. [2025-03-04 02:31:05,507 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 41 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-03-04 02:31:05,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 240 flow [2025-03-04 02:31:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:31:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:31:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 02:31:05,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-03-04 02:31:05,509 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 124 flow. Second operand 5 states and 130 transitions. [2025-03-04 02:31:05,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 240 flow [2025-03-04 02:31:05,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 232 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:31:05,829 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 134 flow [2025-03-04 02:31:05,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2025-03-04 02:31:05,830 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2025-03-04 02:31:05,830 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 134 flow [2025-03-04 02:31:05,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-04 02:31:05,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:05,830 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:05,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:31:05,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:31:05,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash 360205571, now seen corresponding path program 1 times [2025-03-04 02:31:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:05,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163527837] [2025-03-04 02:31:05,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:31:05,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:05,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:31:05,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:31:05,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:31:05,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:31:05,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:05,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163527837] [2025-03-04 02:31:05,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163527837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:31:05,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:31:05,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:31:05,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877657223] [2025-03-04 02:31:05,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:31:05,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:31:05,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:05,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:31:05,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:31:05,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 74 [2025-03-04 02:31:05,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-04 02:31:05,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:05,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 74 [2025-03-04 02:31:05,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:09,263 INFO L124 PetriNetUnfolderBase]: 62802/80978 cut-off events. [2025-03-04 02:31:09,263 INFO L125 PetriNetUnfolderBase]: For 13554/13554 co-relation queries the response was YES. [2025-03-04 02:31:09,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177192 conditions, 80978 events. 62802/80978 cut-off events. For 13554/13554 co-relation queries the response was YES. Maximal size of possible extension queue 1908. Compared 416425 event pairs, 23808 based on Foata normal form. 16/78306 useless extension candidates. Maximal degree in co-relation 80733. Up to 78706 conditions per place. [2025-03-04 02:31:09,705 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 51 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-03-04 02:31:09,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 294 flow [2025-03-04 02:31:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:31:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:31:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-03-04 02:31:09,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35585585585585583 [2025-03-04 02:31:09,707 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 134 flow. Second operand 6 states and 158 transitions. [2025-03-04 02:31:09,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 294 flow [2025-03-04 02:31:09,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 59 transitions, 286 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 02:31:09,854 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 148 flow [2025-03-04 02:31:09,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2025-03-04 02:31:09,854 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2025-03-04 02:31:09,854 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 148 flow [2025-03-04 02:31:09,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-04 02:31:09,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:09,855 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:09,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:31:09,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:31:09,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1172140608, now seen corresponding path program 1 times [2025-03-04 02:31:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:09,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188671498] [2025-03-04 02:31:09,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:31:09,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:09,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:31:09,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:31:09,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:31:09,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:31:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188671498] [2025-03-04 02:31:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188671498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:31:09,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:31:09,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:31:09,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426595073] [2025-03-04 02:31:09,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:31:09,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:31:09,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:09,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:31:09,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:31:09,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 74 [2025-03-04 02:31:09,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 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-04 02:31:09,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:09,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 74 [2025-03-04 02:31:09,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:13,606 INFO L124 PetriNetUnfolderBase]: 61186/82434 cut-off events. [2025-03-04 02:31:13,606 INFO L125 PetriNetUnfolderBase]: For 17998/17998 co-relation queries the response was YES. [2025-03-04 02:31:13,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178493 conditions, 82434 events. 61186/82434 cut-off events. For 17998/17998 co-relation queries the response was YES. Maximal size of possible extension queue 2060. Compared 481288 event pairs, 12288 based on Foata normal form. 64/79938 useless extension candidates. Maximal degree in co-relation 82225. Up to 75266 conditions per place. [2025-03-04 02:31:14,135 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 64 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2025-03-04 02:31:14,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 364 flow [2025-03-04 02:31:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:31:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:31:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2025-03-04 02:31:14,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36486486486486486 [2025-03-04 02:31:14,137 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 148 flow. Second operand 7 states and 189 transitions. [2025-03-04 02:31:14,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 364 flow [2025-03-04 02:31:14,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 352 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 02:31:14,645 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 162 flow [2025-03-04 02:31:14,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2025-03-04 02:31:14,645 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-03-04 02:31:14,645 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 162 flow [2025-03-04 02:31:14,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 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-04 02:31:14,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:14,646 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:14,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:31:14,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:31:14,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:14,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1034262599, now seen corresponding path program 1 times [2025-03-04 02:31:14,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:14,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735309065] [2025-03-04 02:31:14,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:31:14,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:14,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:31:14,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:31:14,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:31:14,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:31:14,655 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:31:14,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:31:14,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:31:14,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:31:14,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:31:14,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:31:14,668 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:31:14,668 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-04 02:31:14,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-03-04 02:31:14,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-04 02:31:14,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-04 02:31:14,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-04 02:31:14,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-04 02:31:14,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-03-04 02:31:14,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-03-04 02:31:14,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 02:31:14,668 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 02:31:14,669 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:31:14,669 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-04 02:31:14,705 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:31:14,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 87 transitions, 282 flow [2025-03-04 02:31:14,711 INFO L124 PetriNetUnfolderBase]: 14/118 cut-off events. [2025-03-04 02:31:14,711 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 02:31:14,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 118 events. 14/118 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 360 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 159. Up to 14 conditions per place. [2025-03-04 02:31:14,712 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 87 transitions, 282 flow [2025-03-04 02:31:14,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 38 transitions, 133 flow [2025-03-04 02:31:14,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:31:14,714 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;@32853ddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:31:14,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 02:31:14,715 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:31:14,715 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-03-04 02:31:14,715 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:31:14,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:14,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:14,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-03-04 02:31:14,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash 600809907, now seen corresponding path program 1 times [2025-03-04 02:31:14,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:14,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67301405] [2025-03-04 02:31:14,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:31:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:14,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:31:14,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:31:14,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:31:14,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:14,741 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-04 02:31:14,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:14,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67301405] [2025-03-04 02:31:14,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67301405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:31:14,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:31:14,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:31:14,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776089476] [2025-03-04 02:31:14,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:31:14,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:31:14,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:14,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:31:14,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:31:14,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 87 [2025-03-04 02:31:14,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-04 02:31:14,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:14,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 87 [2025-03-04 02:31:14,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand