./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/weaver/parallel-ticket-4.wvr.c -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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:40:02,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:40:02,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:40:02,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:40:02,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:40:02,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:40:02,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:40:02,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:40:02,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:40:02,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:40:02,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:40:02,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:40:02,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:40:02,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:40:02,299 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:40:02,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:40:02,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:40:02,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:40:02,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:40:02,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:40:02,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:40:02,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:40:02,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:40:02,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:40:02,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:40:02,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:40:02,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:40:02,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:40:02,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:40:02,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:40:02,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:40:02,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:40:02,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:40:02,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:40:02,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:40:02,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:40:02,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:40:02,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:40:02,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:40:02,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:40:02,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:40:02,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:40:02,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:40:02,302 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-03-17 06:40:02,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:40:02,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:40:02,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:40:02,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:40:02,559 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:40:02,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-17 06:40:03,778 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2484b481/a6ac05dcab7b43a4a6e924650a845e01/FLAGc38fa0060 [2025-03-17 06:40:04,028 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:40:04,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-17 06:40:04,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2484b481/a6ac05dcab7b43a4a6e924650a845e01/FLAGc38fa0060 [2025-03-17 06:40:04,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2484b481/a6ac05dcab7b43a4a6e924650a845e01 [2025-03-17 06:40:04,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:40:04,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:40:04,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:40:04,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:40:04,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:40:04,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a436c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04, skipping insertion in model container [2025-03-17 06:40:04,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:40:04,511 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/weaver/parallel-ticket-4.wvr.c[2554,2567] [2025-03-17 06:40:04,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:40:04,528 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:40:04,547 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/weaver/parallel-ticket-4.wvr.c[2554,2567] [2025-03-17 06:40:04,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:40:04,563 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:40:04,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04 WrapperNode [2025-03-17 06:40:04,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:40:04,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:40:04,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:40:04,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:40:04,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,598 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-03-17 06:40:04,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:40:04,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:40:04,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:40:04,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:40:04,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,621 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-17 06:40:04,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,624 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:40:04,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:40:04,627 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:40:04,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:40:04,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (1/1) ... [2025-03-17 06:40:04,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:40:04,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:04,655 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-17 06:40:04,658 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-17 06:40:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:40:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:40:04,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:40:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:40:04,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:40:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 06:40:04,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 06:40:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 06:40:04,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 06:40:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:40:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:40:04,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:40:04,679 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:40:04,752 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:40:04,754 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:40:04,940 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:40:04,940 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:40:05,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:40:05,067 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:40:05,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:40:05 BoogieIcfgContainer [2025-03-17 06:40:05,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:40:05,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:40:05,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:40:05,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:40:05,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:40:04" (1/3) ... [2025-03-17 06:40:05,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf6f7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:40:05, skipping insertion in model container [2025-03-17 06:40:05,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:04" (2/3) ... [2025-03-17 06:40:05,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf6f7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:40:05, skipping insertion in model container [2025-03-17 06:40:05,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:40:05" (3/3) ... [2025-03-17 06:40:05,074 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-03-17 06:40:05,083 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:40:05,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 57 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-17 06:40:05,085 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:40:05,133 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 06:40:05,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 146 flow [2025-03-17 06:40:05,207 INFO L124 PetriNetUnfolderBase]: 3/55 cut-off events. [2025-03-17 06:40:05,210 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:40:05,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 3/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-17 06:40:05,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 146 flow [2025-03-17 06:40:05,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 132 flow [2025-03-17 06:40:05,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:40:05,230 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;@2c857787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:40:05,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 06:40:05,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:40:05,255 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2025-03-17 06:40:05,255 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:40:05,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:05,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:05,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1298405920, now seen corresponding path program 1 times [2025-03-17 06:40:05,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:05,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860301771] [2025-03-17 06:40:05,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:05,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:05,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 06:40:05,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 06:40:05,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:05,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:05,631 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-17 06:40:05,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:05,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860301771] [2025-03-17 06:40:05,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860301771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:05,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:05,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:40:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214123188] [2025-03-17 06:40:05,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:05,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:40:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:05,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:40:05,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:40:05,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:05,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 06:40:05,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:05,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:05,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:07,173 INFO L124 PetriNetUnfolderBase]: 17631/24183 cut-off events. [2025-03-17 06:40:07,173 INFO L125 PetriNetUnfolderBase]: For 1375/1375 co-relation queries the response was YES. [2025-03-17 06:40:07,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48712 conditions, 24183 events. 17631/24183 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 140414 event pairs, 6173 based on Foata normal form. 1/23393 useless extension candidates. Maximal degree in co-relation 45421. Up to 14774 conditions per place. [2025-03-17 06:40:07,284 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 66 selfloop transitions, 6 changer transitions 1/84 dead transitions. [2025-03-17 06:40:07,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 356 flow [2025-03-17 06:40:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:40:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:40:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-03-17 06:40:07,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2025-03-17 06:40:07,299 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 3 states and 119 transitions. [2025-03-17 06:40:07,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 356 flow [2025-03-17 06:40:07,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 328 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 06:40:07,331 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2025-03-17 06:40:07,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-03-17 06:40:07,335 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2025-03-17 06:40:07,337 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2025-03-17 06:40:07,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 06:40:07,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:07,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:07,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:40:07,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:07,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash -850907849, now seen corresponding path program 1 times [2025-03-17 06:40:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176043827] [2025-03-17 06:40:07,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:07,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 06:40:07,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:07,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:07,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:07,410 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-17 06:40:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:07,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176043827] [2025-03-17 06:40:07,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176043827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:07,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:07,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:40:07,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224532816] [2025-03-17 06:40:07,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:07,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:40:07,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:07,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:40:07,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:40:07,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 59 [2025-03-17 06:40:07,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-17 06:40:07,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:07,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 59 [2025-03-17 06:40:07,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:08,982 INFO L124 PetriNetUnfolderBase]: 24981/33971 cut-off events. [2025-03-17 06:40:08,983 INFO L125 PetriNetUnfolderBase]: For 2745/2745 co-relation queries the response was YES. [2025-03-17 06:40:09,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72790 conditions, 33971 events. 24981/33971 cut-off events. For 2745/2745 co-relation queries the response was YES. Maximal size of possible extension queue 1153. Compared 196152 event pairs, 17656 based on Foata normal form. 0/33394 useless extension candidates. Maximal degree in co-relation 41625. Up to 29158 conditions per place. [2025-03-17 06:40:09,088 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 73 selfloop transitions, 8 changer transitions 0/86 dead transitions. [2025-03-17 06:40:09,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 386 flow [2025-03-17 06:40:09,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:40:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:40:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-17 06:40:09,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2025-03-17 06:40:09,091 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 105 transitions. [2025-03-17 06:40:09,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 386 flow [2025-03-17 06:40:09,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:40:09,098 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2025-03-17 06:40:09,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2025-03-17 06:40:09,099 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2025-03-17 06:40:09,099 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2025-03-17 06:40:09,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-17 06:40:09,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:09,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:09,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:40:09,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 573023741, now seen corresponding path program 1 times [2025-03-17 06:40:09,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:09,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970154371] [2025-03-17 06:40:09,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:09,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:09,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 06:40:09,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:09,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:09,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:09,287 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-17 06:40:09,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:09,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970154371] [2025-03-17 06:40:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970154371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:09,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:40:09,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991424929] [2025-03-17 06:40:09,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:09,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:40:09,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:09,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:40:09,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:40:09,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:09,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-17 06:40:09,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:09,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:09,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:11,745 INFO L124 PetriNetUnfolderBase]: 38556/55598 cut-off events. [2025-03-17 06:40:11,745 INFO L125 PetriNetUnfolderBase]: For 17732/17746 co-relation queries the response was YES. [2025-03-17 06:40:11,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126400 conditions, 55598 events. 38556/55598 cut-off events. For 17732/17746 co-relation queries the response was YES. Maximal size of possible extension queue 2451. Compared 394114 event pairs, 7852 based on Foata normal form. 398/54491 useless extension candidates. Maximal degree in co-relation 67771. Up to 19624 conditions per place. [2025-03-17 06:40:11,962 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 140 selfloop transitions, 27 changer transitions 3/184 dead transitions. [2025-03-17 06:40:11,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 184 transitions, 885 flow [2025-03-17 06:40:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:40:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:40:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2025-03-17 06:40:11,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6836158192090396 [2025-03-17 06:40:11,969 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 6 states and 242 transitions. [2025-03-17 06:40:11,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 184 transitions, 885 flow [2025-03-17 06:40:12,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 184 transitions, 853 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:40:12,063 INFO L231 Difference]: Finished difference. Result has 68 places, 85 transitions, 344 flow [2025-03-17 06:40:12,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=68, PETRI_TRANSITIONS=85} [2025-03-17 06:40:12,063 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 4 predicate places. [2025-03-17 06:40:12,063 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 85 transitions, 344 flow [2025-03-17 06:40:12,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-17 06:40:12,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:12,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:12,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:40:12,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:12,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:12,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1906599287, now seen corresponding path program 2 times [2025-03-17 06:40:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:12,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902369995] [2025-03-17 06:40:12,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:40:12,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:12,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-17 06:40:12,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:12,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:40:12,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:12,259 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-17 06:40:12,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:12,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902369995] [2025-03-17 06:40:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902369995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:12,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:12,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:40:12,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230984181] [2025-03-17 06:40:12,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:12,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:40:12,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:12,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:40:12,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:40:12,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:12,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 85 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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-17 06:40:12,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:12,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:12,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:14,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([408] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][80], [Black: 76#true, 8#L100-1true, 35#L66-3true, Black: 83#(<= ~s~0 ~t~0), 11#thread4EXITtrue, 56#L46-3true, 84#(<= (+ ~s~0 1) ~t~0), Black: 88#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) |thread3Thread1of1ForFork0_#t~post5#1|)), 58#L56-3true, Black: 74#(= (mod ~b~0 256) 0), 94#(<= ~s~0 ~t~0)]) [2025-03-17 06:40:14,895 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-03-17 06:40:14,895 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-17 06:40:14,895 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-17 06:40:14,895 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-17 06:40:14,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L56-3-->L56: Formula: (and (= (+ |v_thread2Thread1of1ForFork1_#t~post4#1_1| 1) v_~s~0_28) (= v_~s~0_29 |v_thread2Thread1of1ForFork1_#t~post4#1_1|)) InVars {~s~0=v_~s~0_29} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|, ~s~0=v_~s~0_28} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, ~s~0][78], [Black: 76#true, 9#L45-1true, 8#L100-1true, 83#(<= ~s~0 ~t~0), 35#L66-3true, 12#L56true, 11#thread4EXITtrue, Black: 88#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) |thread3Thread1of1ForFork0_#t~post5#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 84#(<= (+ ~s~0 1) ~t~0), 92#true]) [2025-03-17 06:40:14,896 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-03-17 06:40:14,896 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-17 06:40:14,896 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-17 06:40:14,896 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-17 06:40:15,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([408] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][80], [Black: 76#true, 35#L66-3true, Black: 83#(<= ~s~0 ~t~0), 11#thread4EXITtrue, 84#(<= (+ ~s~0 1) ~t~0), 46#L101true, 56#L46-3true, Black: 88#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) |thread3Thread1of1ForFork0_#t~post5#1|)), Black: 74#(= (mod ~b~0 256) 0), 58#L56-3true, 94#(<= ~s~0 ~t~0)]) [2025-03-17 06:40:15,150 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-03-17 06:40:15,150 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-17 06:40:15,150 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-17 06:40:15,150 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-17 06:40:15,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L56-3-->L56: Formula: (and (= (+ |v_thread2Thread1of1ForFork1_#t~post4#1_1| 1) v_~s~0_28) (= v_~s~0_29 |v_thread2Thread1of1ForFork1_#t~post4#1_1|)) InVars {~s~0=v_~s~0_29} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|, ~s~0=v_~s~0_28} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, ~s~0][78], [Black: 76#true, 9#L45-1true, 83#(<= ~s~0 ~t~0), 35#L66-3true, 12#L56true, 11#thread4EXITtrue, 46#L101true, Black: 88#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) |thread3Thread1of1ForFork0_#t~post5#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 84#(<= (+ ~s~0 1) ~t~0), 92#true]) [2025-03-17 06:40:15,150 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-03-17 06:40:15,150 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-17 06:40:15,150 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-17 06:40:15,150 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-17 06:40:15,632 INFO L124 PetriNetUnfolderBase]: 50168/73145 cut-off events. [2025-03-17 06:40:15,633 INFO L125 PetriNetUnfolderBase]: For 53244/53350 co-relation queries the response was YES. [2025-03-17 06:40:15,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195862 conditions, 73145 events. 50168/73145 cut-off events. For 53244/53350 co-relation queries the response was YES. Maximal size of possible extension queue 3207. Compared 547188 event pairs, 12329 based on Foata normal form. 642/71704 useless extension candidates. Maximal degree in co-relation 111792. Up to 27673 conditions per place. [2025-03-17 06:40:15,946 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 138 selfloop transitions, 32 changer transitions 5/189 dead transitions. [2025-03-17 06:40:15,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 189 transitions, 1096 flow [2025-03-17 06:40:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:40:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:40:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2025-03-17 06:40:15,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6745762711864407 [2025-03-17 06:40:15,949 INFO L175 Difference]: Start difference. First operand has 68 places, 85 transitions, 344 flow. Second operand 5 states and 199 transitions. [2025-03-17 06:40:15,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 189 transitions, 1096 flow [2025-03-17 06:40:15,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 189 transitions, 1096 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:40:15,999 INFO L231 Difference]: Finished difference. Result has 75 places, 111 transitions, 647 flow [2025-03-17 06:40:15,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=647, PETRI_PLACES=75, PETRI_TRANSITIONS=111} [2025-03-17 06:40:16,000 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2025-03-17 06:40:16,003 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 111 transitions, 647 flow [2025-03-17 06:40:16,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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-17 06:40:16,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:16,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:16,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:40:16,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:16,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash 883178159, now seen corresponding path program 3 times [2025-03-17 06:40:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124105407] [2025-03-17 06:40:16,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:40:16,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:16,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-03-17 06:40:16,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:16,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:40:16,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:16,132 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-17 06:40:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124105407] [2025-03-17 06:40:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124105407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:16,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:16,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:40:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393888182] [2025-03-17 06:40:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:16,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:40:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:16,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:40:16,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:40:16,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:16,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 111 transitions, 647 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-17 06:40:16,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:16,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:16,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:19,796 INFO L124 PetriNetUnfolderBase]: 47912/69481 cut-off events. [2025-03-17 06:40:19,797 INFO L125 PetriNetUnfolderBase]: For 112869/113087 co-relation queries the response was YES. [2025-03-17 06:40:19,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217341 conditions, 69481 events. 47912/69481 cut-off events. For 112869/113087 co-relation queries the response was YES. Maximal size of possible extension queue 3111. Compared 514968 event pairs, 9200 based on Foata normal form. 801/68047 useless extension candidates. Maximal degree in co-relation 123971. Up to 27579 conditions per place. [2025-03-17 06:40:20,110 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 139 selfloop transitions, 59 changer transitions 4/216 dead transitions. [2025-03-17 06:40:20,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 216 transitions, 1433 flow [2025-03-17 06:40:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:40:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:40:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 241 transitions. [2025-03-17 06:40:20,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6807909604519774 [2025-03-17 06:40:20,112 INFO L175 Difference]: Start difference. First operand has 75 places, 111 transitions, 647 flow. Second operand 6 states and 241 transitions. [2025-03-17 06:40:20,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 216 transitions, 1433 flow [2025-03-17 06:40:20,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 216 transitions, 1433 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:40:20,170 INFO L231 Difference]: Finished difference. Result has 81 places, 118 transitions, 844 flow [2025-03-17 06:40:20,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=844, PETRI_PLACES=81, PETRI_TRANSITIONS=118} [2025-03-17 06:40:20,171 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 17 predicate places. [2025-03-17 06:40:20,171 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 118 transitions, 844 flow [2025-03-17 06:40:20,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-17 06:40:20,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:20,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:20,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:40:20,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:20,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2010432989, now seen corresponding path program 4 times [2025-03-17 06:40:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:20,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549598709] [2025-03-17 06:40:20,172 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:40:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:20,182 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-17 06:40:20,192 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:20,192 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:40:20,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:20,334 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-17 06:40:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549598709] [2025-03-17 06:40:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549598709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:20,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:20,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:40:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108349759] [2025-03-17 06:40:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:20,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:40:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:20,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:40:20,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:40:20,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:20,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 118 transitions, 844 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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-17 06:40:20,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:20,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:20,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:24,251 INFO L124 PetriNetUnfolderBase]: 47048/68956 cut-off events. [2025-03-17 06:40:24,251 INFO L125 PetriNetUnfolderBase]: For 177131/177345 co-relation queries the response was YES. [2025-03-17 06:40:24,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234781 conditions, 68956 events. 47048/68956 cut-off events. For 177131/177345 co-relation queries the response was YES. Maximal size of possible extension queue 3086. Compared 517359 event pairs, 11148 based on Foata normal form. 558/67647 useless extension candidates. Maximal degree in co-relation 136193. Up to 27762 conditions per place. [2025-03-17 06:40:24,739 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 142 selfloop transitions, 42 changer transitions 1/199 dead transitions. [2025-03-17 06:40:24,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 199 transitions, 1549 flow [2025-03-17 06:40:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:40:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:40:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2025-03-17 06:40:24,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6711864406779661 [2025-03-17 06:40:24,740 INFO L175 Difference]: Start difference. First operand has 81 places, 118 transitions, 844 flow. Second operand 5 states and 198 transitions. [2025-03-17 06:40:24,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 199 transitions, 1549 flow [2025-03-17 06:40:24,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 199 transitions, 1439 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-17 06:40:24,866 INFO L231 Difference]: Finished difference. Result has 83 places, 124 transitions, 934 flow [2025-03-17 06:40:24,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=934, PETRI_PLACES=83, PETRI_TRANSITIONS=124} [2025-03-17 06:40:24,867 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 19 predicate places. [2025-03-17 06:40:24,867 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 124 transitions, 934 flow [2025-03-17 06:40:24,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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-17 06:40:24,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:24,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:40:24,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:24,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1997827613, now seen corresponding path program 2 times [2025-03-17 06:40:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760322394] [2025-03-17 06:40:24,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:40:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:24,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-17 06:40:24,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:24,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:40:24,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:24,976 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-17 06:40:24,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760322394] [2025-03-17 06:40:24,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760322394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:24,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:24,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:40:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400566477] [2025-03-17 06:40:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:24,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:40:24,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:24,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:40:24,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:40:24,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:24,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 124 transitions, 934 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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-17 06:40:24,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:24,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:24,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:28,643 INFO L124 PetriNetUnfolderBase]: 44544/65995 cut-off events. [2025-03-17 06:40:28,644 INFO L125 PetriNetUnfolderBase]: For 186287/186439 co-relation queries the response was YES. [2025-03-17 06:40:28,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224645 conditions, 65995 events. 44544/65995 cut-off events. For 186287/186439 co-relation queries the response was YES. Maximal size of possible extension queue 3042. Compared 503387 event pairs, 11024 based on Foata normal form. 748/65092 useless extension candidates. Maximal degree in co-relation 132224. Up to 27059 conditions per place. [2025-03-17 06:40:28,945 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 139 selfloop transitions, 52 changer transitions 8/213 dead transitions. [2025-03-17 06:40:28,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 213 transitions, 1778 flow [2025-03-17 06:40:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:40:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:40:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2025-03-17 06:40:28,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-03-17 06:40:28,946 INFO L175 Difference]: Start difference. First operand has 83 places, 124 transitions, 934 flow. Second operand 5 states and 200 transitions. [2025-03-17 06:40:28,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 213 transitions, 1778 flow [2025-03-17 06:40:29,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 213 transitions, 1698 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-17 06:40:29,040 INFO L231 Difference]: Finished difference. Result has 86 places, 136 transitions, 1170 flow [2025-03-17 06:40:29,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1170, PETRI_PLACES=86, PETRI_TRANSITIONS=136} [2025-03-17 06:40:29,041 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 22 predicate places. [2025-03-17 06:40:29,041 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 136 transitions, 1170 flow [2025-03-17 06:40:29,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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-17 06:40:29,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:29,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:29,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:40:29,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:29,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1736562193, now seen corresponding path program 5 times [2025-03-17 06:40:29,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:29,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369482989] [2025-03-17 06:40:29,043 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:40:29,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:29,050 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-17 06:40:29,057 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:29,058 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:40:29,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:29,144 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-17 06:40:29,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:29,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369482989] [2025-03-17 06:40:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369482989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:29,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:29,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:40:29,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317864048] [2025-03-17 06:40:29,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:29,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:40:29,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:29,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:40:29,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:40:29,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:29,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 136 transitions, 1170 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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-17 06:40:29,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:29,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:29,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:31,920 INFO L124 PetriNetUnfolderBase]: 30183/44575 cut-off events. [2025-03-17 06:40:31,921 INFO L125 PetriNetUnfolderBase]: For 134167/134259 co-relation queries the response was YES. [2025-03-17 06:40:32,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153129 conditions, 44575 events. 30183/44575 cut-off events. For 134167/134259 co-relation queries the response was YES. Maximal size of possible extension queue 2015. Compared 318457 event pairs, 7907 based on Foata normal form. 392/43917 useless extension candidates. Maximal degree in co-relation 105632. Up to 21727 conditions per place. [2025-03-17 06:40:32,124 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 129 selfloop transitions, 60 changer transitions 8/211 dead transitions. [2025-03-17 06:40:32,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 211 transitions, 1943 flow [2025-03-17 06:40:32,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:40:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:40:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-03-17 06:40:32,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6542372881355932 [2025-03-17 06:40:32,125 INFO L175 Difference]: Start difference. First operand has 86 places, 136 transitions, 1170 flow. Second operand 5 states and 193 transitions. [2025-03-17 06:40:32,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 211 transitions, 1943 flow [2025-03-17 06:40:32,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 211 transitions, 1876 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:40:32,181 INFO L231 Difference]: Finished difference. Result has 90 places, 142 transitions, 1383 flow [2025-03-17 06:40:32,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1383, PETRI_PLACES=90, PETRI_TRANSITIONS=142} [2025-03-17 06:40:32,182 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 26 predicate places. [2025-03-17 06:40:32,182 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 142 transitions, 1383 flow [2025-03-17 06:40:32,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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-17 06:40:32,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:32,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:32,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:40:32,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:32,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1825588379, now seen corresponding path program 6 times [2025-03-17 06:40:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919559904] [2025-03-17 06:40:32,183 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:40:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:32,189 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 1 equivalence classes. [2025-03-17 06:40:32,193 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:32,194 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 06:40:32,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:32,285 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-17 06:40:32,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:32,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919559904] [2025-03-17 06:40:32,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919559904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:32,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:32,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:40:32,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796959491] [2025-03-17 06:40:32,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:32,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:40:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:32,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:40:32,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:40:32,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:32,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 142 transitions, 1383 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 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-17 06:40:32,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:32,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:32,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:35,138 INFO L124 PetriNetUnfolderBase]: 30490/45030 cut-off events. [2025-03-17 06:40:35,138 INFO L125 PetriNetUnfolderBase]: For 153095/153269 co-relation queries the response was YES. [2025-03-17 06:40:35,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160932 conditions, 45030 events. 30490/45030 cut-off events. For 153095/153269 co-relation queries the response was YES. Maximal size of possible extension queue 2085. Compared 323433 event pairs, 7095 based on Foata normal form. 433/44176 useless extension candidates. Maximal degree in co-relation 111817. Up to 16695 conditions per place. [2025-03-17 06:40:35,389 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 160 selfloop transitions, 98 changer transitions 5/277 dead transitions. [2025-03-17 06:40:35,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 277 transitions, 2591 flow [2025-03-17 06:40:35,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:40:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:40:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 304 transitions. [2025-03-17 06:40:35,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2025-03-17 06:40:35,390 INFO L175 Difference]: Start difference. First operand has 90 places, 142 transitions, 1383 flow. Second operand 8 states and 304 transitions. [2025-03-17 06:40:35,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 277 transitions, 2591 flow [2025-03-17 06:40:35,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 277 transitions, 2507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:40:35,449 INFO L231 Difference]: Finished difference. Result has 97 places, 158 transitions, 1790 flow [2025-03-17 06:40:35,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1790, PETRI_PLACES=97, PETRI_TRANSITIONS=158} [2025-03-17 06:40:35,450 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 33 predicate places. [2025-03-17 06:40:35,450 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 158 transitions, 1790 flow [2025-03-17 06:40:35,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 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-17 06:40:35,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:35,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:35,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:40:35,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:35,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash 403738443, now seen corresponding path program 1 times [2025-03-17 06:40:35,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:35,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728828268] [2025-03-17 06:40:35,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:35,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:35,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 06:40:35,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:35,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:35,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:35,591 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-17 06:40:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728828268] [2025-03-17 06:40:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728828268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:35,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:35,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:40:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108945168] [2025-03-17 06:40:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:35,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:40:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:35,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:40:35,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:40:35,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:35,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 158 transitions, 1790 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 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-17 06:40:35,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:35,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:35,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:38,594 INFO L124 PetriNetUnfolderBase]: 29213/43612 cut-off events. [2025-03-17 06:40:38,595 INFO L125 PetriNetUnfolderBase]: For 180035/180151 co-relation queries the response was YES. [2025-03-17 06:40:38,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162529 conditions, 43612 events. 29213/43612 cut-off events. For 180035/180151 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 317134 event pairs, 6797 based on Foata normal form. 811/43288 useless extension candidates. Maximal degree in co-relation 115411. Up to 16291 conditions per place. [2025-03-17 06:40:38,801 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 159 selfloop transitions, 103 changer transitions 26/302 dead transitions. [2025-03-17 06:40:38,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 302 transitions, 3142 flow [2025-03-17 06:40:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:40:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:40:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 310 transitions. [2025-03-17 06:40:38,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6567796610169492 [2025-03-17 06:40:38,802 INFO L175 Difference]: Start difference. First operand has 97 places, 158 transitions, 1790 flow. Second operand 8 states and 310 transitions. [2025-03-17 06:40:38,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 302 transitions, 3142 flow [2025-03-17 06:40:38,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 302 transitions, 2994 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:40:38,886 INFO L231 Difference]: Finished difference. Result has 103 places, 163 transitions, 1968 flow [2025-03-17 06:40:38,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1968, PETRI_PLACES=103, PETRI_TRANSITIONS=163} [2025-03-17 06:40:38,887 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 39 predicate places. [2025-03-17 06:40:38,887 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 163 transitions, 1968 flow [2025-03-17 06:40:38,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 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-17 06:40:38,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:38,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:38,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:40:38,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:38,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1919279349, now seen corresponding path program 7 times [2025-03-17 06:40:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:38,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-03-17 06:40:38,888 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:40:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:38,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 06:40:38,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 06:40:38,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:38,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:38,967 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-17 06:40:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:38,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-03-17 06:40:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256298778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:38,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:38,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:40:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831327369] [2025-03-17 06:40:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:38,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:40:38,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:38,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:40:38,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:40:38,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-03-17 06:40:38,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 163 transitions, 1968 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 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-17 06:40:38,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:38,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-03-17 06:40:38,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand