/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:37:16,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:37:16,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:37:16,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:37:16,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:37:16,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:37:16,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:37:16,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:37:16,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:37:16,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:37:16,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:37:16,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:37:16,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:37:16,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:37:16,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:37:16,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:16,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:16,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:37:16,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:37:16,831 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:37:17,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:37:17,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:37:17,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:37:17,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:37:17,053 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:37:17,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2025-04-14 00:37:18,322 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aed5fbc6/793ef822ce684c1da5798e7fd16b4e2e/FLAGa7d67580d [2025-04-14 00:37:18,568 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:37:18,569 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2025-04-14 00:37:18,578 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aed5fbc6/793ef822ce684c1da5798e7fd16b4e2e/FLAGa7d67580d [2025-04-14 00:37:19,373 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aed5fbc6/793ef822ce684c1da5798e7fd16b4e2e [2025-04-14 00:37:19,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:37:19,377 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:37:19,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:37:19,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:37:19,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:37:19,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c137917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19, skipping insertion in model container [2025-04-14 00:37:19,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:37:19,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c[3984,3997] [2025-04-14 00:37:19,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:37:19,586 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:37:19,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c[3984,3997] [2025-04-14 00:37:19,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:37:19,626 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:37:19,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19 WrapperNode [2025-04-14 00:37:19,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:37:19,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:37:19,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:37:19,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:37:19,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,675 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 406 [2025-04-14 00:37:19,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:37:19,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:37:19,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:37:19,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:37:19,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,717 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-04-14 00:37:19,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:37:19,735 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:37:19,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:37:19,735 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:37:19,736 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (1/1) ... [2025-04-14 00:37:19,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:19,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:19,765 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-04-14 00:37:19,767 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-04-14 00:37:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:37:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:37:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:37:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:37:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:37:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:37:19,785 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:37:19,890 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:37:19,892 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:37:20,350 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:37:20,351 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:37:20,351 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:37:20,853 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:37:20,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:37:20 BoogieIcfgContainer [2025-04-14 00:37:20,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:37:20,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:37:20,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:37:20,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:37:20,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:37:19" (1/3) ... [2025-04-14 00:37:20,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670a7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:37:20, skipping insertion in model container [2025-04-14 00:37:20,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:19" (2/3) ... [2025-04-14 00:37:20,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670a7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:37:20, skipping insertion in model container [2025-04-14 00:37:20,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:37:20" (3/3) ... [2025-04-14 00:37:20,860 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-04-14 00:37:20,871 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:37:20,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 00:37:20,873 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:37:20,925 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:37:20,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-14 00:37:20,974 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-14 00:37:20,976 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:37:20,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 12 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-14 00:37:20,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-14 00:37:20,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-14 00:37:20,984 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:37:20,992 INFO L340 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;@4788bb0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:37:20,992 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:37:21,003 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:37:21,004 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-14 00:37:21,004 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:37:21,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:21,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] [2025-04-14 00:37:21,005 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:21,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -895271138, now seen corresponding path program 1 times [2025-04-14 00:37:21,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:21,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797558550] [2025-04-14 00:37:21,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:21,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:37:21,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:37:21,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:21,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:37:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:21,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797558550] [2025-04-14 00:37:21,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797558550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:21,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:21,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:37:21,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666067916] [2025-04-14 00:37:21,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:21,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:37:21,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:21,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:37:21,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:37:21,508 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:21,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-04-14 00:37:21,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:21,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:21,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:21,606 INFO L116 PetriNetUnfolderBase]: 38/82 cut-off events. [2025-04-14 00:37:21,606 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-14 00:37:21,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 82 events. 38/82 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2025-04-14 00:37:21,609 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-04-14 00:37:21,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 126 flow [2025-04-14 00:37:21,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:37:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:37:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 00:37:21,618 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2025-04-14 00:37:21,619 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 3 states and 37 transitions. [2025-04-14 00:37:21,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 126 flow [2025-04-14 00:37:21,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:37:21,625 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 70 flow [2025-04-14 00:37:21,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-04-14 00:37:21,628 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-14 00:37:21,629 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 70 flow [2025-04-14 00:37:21,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-04-14 00:37:21,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:21,629 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] [2025-04-14 00:37:21,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:37:21,629 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:21,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash -36453043, now seen corresponding path program 1 times [2025-04-14 00:37:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:21,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391651650] [2025-04-14 00:37:21,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:21,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:37:21,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:37:21,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:21,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:37:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:21,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391651650] [2025-04-14 00:37:21,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391651650] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:21,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:21,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233497863] [2025-04-14 00:37:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:21,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:21,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:21,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:21,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:21,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-04-14 00:37:21,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:21,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:21,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:21,963 INFO L116 PetriNetUnfolderBase]: 38/83 cut-off events. [2025-04-14 00:37:21,963 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:37:21,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 83 events. 38/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 171. Up to 82 conditions per place. [2025-04-14 00:37:21,964 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 25 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-04-14 00:37:21,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 128 flow [2025-04-14 00:37:21,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-14 00:37:21,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:37:21,966 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 70 flow. Second operand 4 states and 40 transitions. [2025-04-14 00:37:21,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 128 flow [2025-04-14 00:37:21,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 124 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:21,967 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 80 flow [2025-04-14 00:37:21,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2025-04-14 00:37:21,967 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2025-04-14 00:37:21,967 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 80 flow [2025-04-14 00:37:21,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-04-14 00:37:21,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:21,967 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] [2025-04-14 00:37:21,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:37:21,967 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:21,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash 82429693, now seen corresponding path program 1 times [2025-04-14 00:37:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:21,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510628838] [2025-04-14 00:37:21,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:21,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:21,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:37:22,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:37:22,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:22,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:37:22,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:22,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510628838] [2025-04-14 00:37:22,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510628838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:22,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:22,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780457409] [2025-04-14 00:37:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:22,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:22,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:22,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:22,136 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:22,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-04-14 00:37:22,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:22,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:22,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:22,239 INFO L116 PetriNetUnfolderBase]: 38/84 cut-off events. [2025-04-14 00:37:22,239 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:37:22,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 84 events. 38/84 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 171. Up to 82 conditions per place. [2025-04-14 00:37:22,240 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 25 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-04-14 00:37:22,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 140 flow [2025-04-14 00:37:22,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-14 00:37:22,241 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2025-04-14 00:37:22,241 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 80 flow. Second operand 4 states and 41 transitions. [2025-04-14 00:37:22,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 140 flow [2025-04-14 00:37:22,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 134 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:22,242 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 92 flow [2025-04-14 00:37:22,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-04-14 00:37:22,242 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-04-14 00:37:22,242 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 92 flow [2025-04-14 00:37:22,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-04-14 00:37:22,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:22,243 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] [2025-04-14 00:37:22,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:37:22,243 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:22,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash -144933122, now seen corresponding path program 1 times [2025-04-14 00:37:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:22,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367534583] [2025-04-14 00:37:22,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:22,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:37:22,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:37:22,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:22,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:37:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:22,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367534583] [2025-04-14 00:37:22,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367534583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:22,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:22,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:22,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700518205] [2025-04-14 00:37:22,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:22,423 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:22,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:22,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:22,424 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:22,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-04-14 00:37:22,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:22,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:22,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:22,514 INFO L116 PetriNetUnfolderBase]: 38/85 cut-off events. [2025-04-14 00:37:22,514 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:37:22,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 85 events. 38/85 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 176. Up to 84 conditions per place. [2025-04-14 00:37:22,516 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 27 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2025-04-14 00:37:22,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 154 flow [2025-04-14 00:37:22,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-14 00:37:22,518 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:37:22,518 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 92 flow. Second operand 4 states and 40 transitions. [2025-04-14 00:37:22,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 154 flow [2025-04-14 00:37:22,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:22,519 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 102 flow [2025-04-14 00:37:22,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-04-14 00:37:22,520 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2025-04-14 00:37:22,520 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 102 flow [2025-04-14 00:37:22,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-04-14 00:37:22,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:22,520 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] [2025-04-14 00:37:22,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:37:22,520 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:22,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1282915139, now seen corresponding path program 1 times [2025-04-14 00:37:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:22,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823869662] [2025-04-14 00:37:22,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:22,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:37:22,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:37:22,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:22,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 00:37:22,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:22,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823869662] [2025-04-14 00:37:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823869662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:22,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:22,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237346356] [2025-04-14 00:37:22,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:22,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:22,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:22,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:22,668 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:22,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-04-14 00:37:22,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:22,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:22,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:22,757 INFO L116 PetriNetUnfolderBase]: 38/86 cut-off events. [2025-04-14 00:37:22,757 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:37:22,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 86 events. 38/86 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 182. Up to 85 conditions per place. [2025-04-14 00:37:22,758 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-04-14 00:37:22,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 166 flow [2025-04-14 00:37:22,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-14 00:37:22,758 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:37:22,759 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 102 flow. Second operand 4 states and 40 transitions. [2025-04-14 00:37:22,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 166 flow [2025-04-14 00:37:22,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 160 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:22,760 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 110 flow [2025-04-14 00:37:22,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-04-14 00:37:22,760 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-14 00:37:22,760 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 110 flow [2025-04-14 00:37:22,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-04-14 00:37:22,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:22,760 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] [2025-04-14 00:37:22,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:37:22,761 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:22,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash -766507089, now seen corresponding path program 1 times [2025-04-14 00:37:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:22,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833221184] [2025-04-14 00:37:22,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:22,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:37:22,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:37:22,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:22,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:37:22,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:22,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833221184] [2025-04-14 00:37:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833221184] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105806235] [2025-04-14 00:37:22,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:22,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:22,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:22,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:22,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:22,910 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:22,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-04-14 00:37:22,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:22,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:22,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:22,994 INFO L116 PetriNetUnfolderBase]: 38/87 cut-off events. [2025-04-14 00:37:22,995 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-14 00:37:22,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 87 events. 38/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 187. Up to 86 conditions per place. [2025-04-14 00:37:22,996 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 29 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-04-14 00:37:22,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 176 flow [2025-04-14 00:37:22,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-14 00:37:22,998 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:37:22,998 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 110 flow. Second operand 4 states and 40 transitions. [2025-04-14 00:37:22,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 176 flow [2025-04-14 00:37:22,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:23,000 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 118 flow [2025-04-14 00:37:23,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-04-14 00:37:23,000 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2025-04-14 00:37:23,000 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 118 flow [2025-04-14 00:37:23,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-04-14 00:37:23,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:23,001 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] [2025-04-14 00:37:23,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:37:23,001 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:23,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash -981420179, now seen corresponding path program 1 times [2025-04-14 00:37:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:23,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497941771] [2025-04-14 00:37:23,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:23,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:37:23,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:37:23,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:23,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:37:23,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:23,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497941771] [2025-04-14 00:37:23,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497941771] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:23,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:23,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:23,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394464464] [2025-04-14 00:37:23,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:23,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:23,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:23,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:23,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:23,795 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:23,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:23,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:23,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:23,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:23,947 INFO L116 PetriNetUnfolderBase]: 39/105 cut-off events. [2025-04-14 00:37:23,948 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-14 00:37:23,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 105 events. 39/105 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 280 event pairs, 7 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 227. Up to 41 conditions per place. [2025-04-14 00:37:23,948 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 42 selfloop transitions, 2 changer transitions 7/51 dead transitions. [2025-04-14 00:37:23,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 267 flow [2025-04-14 00:37:23,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-14 00:37:23,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2025-04-14 00:37:23,949 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 118 flow. Second operand 5 states and 61 transitions. [2025-04-14 00:37:23,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 267 flow [2025-04-14 00:37:23,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 261 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:23,950 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 127 flow [2025-04-14 00:37:23,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-04-14 00:37:23,951 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-04-14 00:37:23,951 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 127 flow [2025-04-14 00:37:23,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:23,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:23,951 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] [2025-04-14 00:37:23,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:37:23,951 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:23,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:23,952 INFO L85 PathProgramCache]: Analyzing trace with hash -933703967, now seen corresponding path program 2 times [2025-04-14 00:37:23,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:23,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321621228] [2025-04-14 00:37:23,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:23,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:23,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:37:23,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:37:23,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:23,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:37:24,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:24,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321621228] [2025-04-14 00:37:24,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321621228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:24,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:24,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673776963] [2025-04-14 00:37:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:24,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:24,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:24,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:24,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:24,640 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:24,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:24,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:24,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:24,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:24,777 INFO L116 PetriNetUnfolderBase]: 35/109 cut-off events. [2025-04-14 00:37:24,777 INFO L117 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-04-14 00:37:24,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 109 events. 35/109 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 299 event pairs, 10 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 290. Up to 48 conditions per place. [2025-04-14 00:37:24,778 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 41 selfloop transitions, 3 changer transitions 5/49 dead transitions. [2025-04-14 00:37:24,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 275 flow [2025-04-14 00:37:24,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-04-14 00:37:24,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2025-04-14 00:37:24,779 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 127 flow. Second operand 5 states and 58 transitions. [2025-04-14 00:37:24,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 275 flow [2025-04-14 00:37:24,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 268 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:24,781 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 144 flow [2025-04-14 00:37:24,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2025-04-14 00:37:24,781 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-04-14 00:37:24,781 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 144 flow [2025-04-14 00:37:24,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:24,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:24,782 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] [2025-04-14 00:37:24,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:37:24,782 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:24,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:24,782 INFO L85 PathProgramCache]: Analyzing trace with hash -104336745, now seen corresponding path program 3 times [2025-04-14 00:37:24,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:24,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080761725] [2025-04-14 00:37:24,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:37:24,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:24,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:37:24,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:37:24,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:37:24,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:37:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:25,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080761725] [2025-04-14 00:37:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080761725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111170733] [2025-04-14 00:37:25,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:25,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:25,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:25,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:25,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:25,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:25,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:25,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:25,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:25,347 INFO L116 PetriNetUnfolderBase]: 35/112 cut-off events. [2025-04-14 00:37:25,348 INFO L117 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-04-14 00:37:25,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 112 events. 35/112 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 346 event pairs, 8 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 348. Up to 50 conditions per place. [2025-04-14 00:37:25,349 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 40 selfloop transitions, 2 changer transitions 9/51 dead transitions. [2025-04-14 00:37:25,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 307 flow [2025-04-14 00:37:25,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-04-14 00:37:25,349 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2025-04-14 00:37:25,349 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 144 flow. Second operand 5 states and 59 transitions. [2025-04-14 00:37:25,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 307 flow [2025-04-14 00:37:25,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 296 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:25,351 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 151 flow [2025-04-14 00:37:25,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2025-04-14 00:37:25,352 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-04-14 00:37:25,352 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 151 flow [2025-04-14 00:37:25,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:25,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:25,352 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] [2025-04-14 00:37:25,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:37:25,352 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:25,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1427854793, now seen corresponding path program 4 times [2025-04-14 00:37:25,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:25,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372803978] [2025-04-14 00:37:25,352 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:37:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:25,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:37:25,384 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:37:25,384 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:37:25,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:37:25,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:25,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372803978] [2025-04-14 00:37:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372803978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:25,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:25,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:25,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524465139] [2025-04-14 00:37:25,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:25,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:25,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:25,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:25,797 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:25,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:25,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:25,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:25,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:25,945 INFO L116 PetriNetUnfolderBase]: 30/96 cut-off events. [2025-04-14 00:37:25,946 INFO L117 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2025-04-14 00:37:25,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 96 events. 30/96 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 223 event pairs, 15 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 327. Up to 64 conditions per place. [2025-04-14 00:37:25,946 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 40 selfloop transitions, 3 changer transitions 7/50 dead transitions. [2025-04-14 00:37:25,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 319 flow [2025-04-14 00:37:25,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-14 00:37:25,947 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-04-14 00:37:25,947 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 151 flow. Second operand 5 states and 57 transitions. [2025-04-14 00:37:25,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 319 flow [2025-04-14 00:37:25,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 300 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-14 00:37:25,949 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 158 flow [2025-04-14 00:37:25,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-04-14 00:37:25,951 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-04-14 00:37:25,952 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 158 flow [2025-04-14 00:37:25,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:25,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:25,952 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] [2025-04-14 00:37:25,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:37:25,952 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:25,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1820092229, now seen corresponding path program 5 times [2025-04-14 00:37:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:25,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229056010] [2025-04-14 00:37:25,952 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:37:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:25,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:37:25,996 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:37:25,997 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:37:25,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:37:26,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:26,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229056010] [2025-04-14 00:37:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229056010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:26,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:26,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:26,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959900357] [2025-04-14 00:37:26,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:26,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:26,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:26,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:26,475 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:26,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:26,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:26,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:26,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:26,596 INFO L116 PetriNetUnfolderBase]: 24/76 cut-off events. [2025-04-14 00:37:26,596 INFO L117 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-04-14 00:37:26,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 76 events. 24/76 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 142 event pairs, 7 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 271. Up to 45 conditions per place. [2025-04-14 00:37:26,597 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 33 selfloop transitions, 1 changer transitions 14/48 dead transitions. [2025-04-14 00:37:26,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 296 flow [2025-04-14 00:37:26,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-14 00:37:26,598 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-04-14 00:37:26,598 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 158 flow. Second operand 5 states and 57 transitions. [2025-04-14 00:37:26,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 296 flow [2025-04-14 00:37:26,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 284 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:37:26,599 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 137 flow [2025-04-14 00:37:26,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2025-04-14 00:37:26,600 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2025-04-14 00:37:26,600 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 137 flow [2025-04-14 00:37:26,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:26,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:26,600 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] [2025-04-14 00:37:26,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:37:26,600 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:26,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1446623123, now seen corresponding path program 6 times [2025-04-14 00:37:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:26,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362581382] [2025-04-14 00:37:26,601 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:37:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:26,613 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:37:26,625 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:37:26,625 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:37:26,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:37:26,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:26,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362581382] [2025-04-14 00:37:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362581382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:26,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:26,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:26,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212284421] [2025-04-14 00:37:26,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:26,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:26,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:26,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:26,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:37:26,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:26,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:26,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:37:26,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:27,075 INFO L116 PetriNetUnfolderBase]: 15/51 cut-off events. [2025-04-14 00:37:27,075 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-14 00:37:27,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 51 events. 15/51 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 5 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 176. Up to 38 conditions per place. [2025-04-14 00:37:27,075 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2025-04-14 00:37:27,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 227 flow [2025-04-14 00:37:27,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-14 00:37:27,076 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31333333333333335 [2025-04-14 00:37:27,076 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 137 flow. Second operand 5 states and 47 transitions. [2025-04-14 00:37:27,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 227 flow [2025-04-14 00:37:27,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 209 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-04-14 00:37:27,077 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2025-04-14 00:37:27,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2025-04-14 00:37:27,077 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2025-04-14 00:37:27,077 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2025-04-14 00:37:27,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-04-14 00:37:27,081 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:37:27,082 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:37:27,082 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:37:27,082 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:37:27,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:37:27,082 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:27,084 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:37:27,084 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:37:27,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:37:27 BasicIcfg [2025-04-14 00:37:27,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:37:27,088 INFO L158 Benchmark]: Toolchain (without parser) took 7711.34ms. Allocated memory was 167.8MB in the beginning and 541.1MB in the end (delta: 373.3MB). Free memory was 119.4MB in the beginning and 358.5MB in the end (delta: -239.2MB). Peak memory consumption was 134.8MB. Max. memory is 8.0GB. [2025-04-14 00:37:27,088 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:37:27,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.43ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 103.3MB in the end (delta: 16.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:37:27,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.16ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 99.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:37:27,090 INFO L158 Benchmark]: Boogie Preprocessor took 53.78ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 96.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:37:27,090 INFO L158 Benchmark]: IcfgBuilder took 1118.96ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 96.4MB in the end (delta: 107.8kB). Peak memory consumption was 79.5MB. Max. memory is 8.0GB. [2025-04-14 00:37:27,091 INFO L158 Benchmark]: TraceAbstraction took 6233.00ms. Allocated memory was 167.8MB in the beginning and 541.1MB in the end (delta: 373.3MB). Free memory was 95.4MB in the beginning and 358.5MB in the end (delta: -263.2MB). Peak memory consumption was 113.1MB. Max. memory is 8.0GB. [2025-04-14 00:37:27,092 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.43ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 103.3MB in the end (delta: 16.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.16ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 99.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.78ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 96.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1118.96ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 96.4MB in the end (delta: 107.8kB). Peak memory consumption was 79.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6233.00ms. Allocated memory was 167.8MB in the beginning and 541.1MB in the end (delta: 373.3MB). Free memory was 95.4MB in the beginning and 358.5MB in the end (delta: -263.2MB). Peak memory consumption was 113.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 34 locations, 39 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1062 IncrementalHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 1062 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 291 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1377 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 51/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:37:27,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...