/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-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:37:05,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:37:05,641 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:05,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:37:05,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:37:05,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:37:05,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:37:05,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:37:05,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:37:05,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:37:05,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:37:05,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:37:05,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:37:05,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:37:05,671 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:37:05,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:37:05,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:37:05,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:37:05,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:05,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:05,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:37:05,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:37:05,673 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:05,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:37:05,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:37:05,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:37:05,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:37:05,914 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:37:05,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2025-04-14 00:37:07,197 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39298398a/30cb0c31f8e443fcb57344e14f1a6efe/FLAG3338dde50 [2025-04-14 00:37:07,457 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:37:07,460 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2025-04-14 00:37:07,469 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39298398a/30cb0c31f8e443fcb57344e14f1a6efe/FLAG3338dde50 [2025-04-14 00:37:08,248 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39298398a/30cb0c31f8e443fcb57344e14f1a6efe [2025-04-14 00:37:08,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:37:08,251 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:37:08,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:37:08,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:37:08,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:37:08,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:37:08" (1/1) ... [2025-04-14 00:37:08,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583d88dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:08, skipping insertion in model container [2025-04-14 00:37:08,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:37:08" (1/1) ... [2025-04-14 00:37:08,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:37:08,408 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-symm.wvr.c[3331,3344] [2025-04-14 00:37:08,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:37:08,431 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:37:08,472 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-symm.wvr.c[3331,3344] [2025-04-14 00:37:08,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:37:08,502 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:37:08,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:08 WrapperNode [2025-04-14 00:37:08,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:37:08,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:37:08,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:37:08,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:37:08,509 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:08" (1/1) ... [2025-04-14 00:37:08,519 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:08" (1/1) ... [2025-04-14 00:37:08,547 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 277 [2025-04-14 00:37:08,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:37:08,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:37:08,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:37:08,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:37:08,554 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:08" (1/1) ... [2025-04-14 00:37:08,554 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:08" (1/1) ... [2025-04-14 00:37:08,561 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:08" (1/1) ... [2025-04-14 00:37:08,576 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 10, 6]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-04-14 00:37:08,576 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:08" (1/1) ... [2025-04-14 00:37:08,576 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:08" (1/1) ... [2025-04-14 00:37:08,587 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:08" (1/1) ... [2025-04-14 00:37:08,589 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:08" (1/1) ... [2025-04-14 00:37:08,590 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:08" (1/1) ... [2025-04-14 00:37:08,591 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:08" (1/1) ... [2025-04-14 00:37:08,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:37:08,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:37:08,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:37:08,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:37:08,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:08" (1/1) ... [2025-04-14 00:37:08,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:08,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:08,624 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:08,630 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:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:37:08,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:37:08,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:37:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:37:08,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:37:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:37:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:37:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:37:08,647 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:08,752 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:37:08,753 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:37:09,147 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:37:09,148 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:37:09,148 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:37:09,547 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:37:09,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:37:09 BoogieIcfgContainer [2025-04-14 00:37:09,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:37:09,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:37:09,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:37:09,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:37:09,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:37:08" (1/3) ... [2025-04-14 00:37:09,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4abe03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:37:09, skipping insertion in model container [2025-04-14 00:37:09,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:08" (2/3) ... [2025-04-14 00:37:09,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4abe03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:37:09, skipping insertion in model container [2025-04-14 00:37:09,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:37:09" (3/3) ... [2025-04-14 00:37:09,555 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-04-14 00:37:09,565 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:37:09,566 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 00:37:09,567 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:37:09,612 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:37:09,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 56 flow [2025-04-14 00:37:09,698 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-14 00:37:09,702 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:37:09,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 4/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-04-14 00:37:09,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 56 flow [2025-04-14 00:37:09,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 18 transitions, 48 flow [2025-04-14 00:37:09,714 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:37:09,724 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;@2d6fd4d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:37:09,724 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:37:09,734 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:37:09,734 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-14 00:37:09,734 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:37:09,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:09,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:09,735 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:09,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -456099443, now seen corresponding path program 1 times [2025-04-14 00:37:09,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:09,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219550846] [2025-04-14 00:37:09,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:09,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:37:09,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:37:09,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:09,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:10,167 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:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:10,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219550846] [2025-04-14 00:37:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219550846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:10,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:10,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:37:10,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800022646] [2025-04-14 00:37:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:10,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:37:10,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:10,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:37:10,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:37:10,198 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:37:10,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:10,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:10,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:37:10,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:10,270 INFO L116 PetriNetUnfolderBase]: 12/34 cut-off events. [2025-04-14 00:37:10,271 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:37:10,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 34 events. 12/34 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 8 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 40. Up to 34 conditions per place. [2025-04-14 00:37:10,273 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2025-04-14 00:37:10,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 88 flow [2025-04-14 00:37:10,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:37:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:37:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-04-14 00:37:10,283 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2025-04-14 00:37:10,284 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 48 flow. Second operand 3 states and 26 transitions. [2025-04-14 00:37:10,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 88 flow [2025-04-14 00:37:10,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 19 transitions, 80 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:37:10,294 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 52 flow [2025-04-14 00:37:10,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2025-04-14 00:37:10,298 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-04-14 00:37:10,298 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 52 flow [2025-04-14 00:37:10,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:10,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:10,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:10,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:37:10,299 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:10,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash -290457896, now seen corresponding path program 1 times [2025-04-14 00:37:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:10,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931493486] [2025-04-14 00:37:10,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:10,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:37:10,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:37:10,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:10,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:10,487 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:10,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:10,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931493486] [2025-04-14 00:37:10,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931493486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:10,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:10,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:10,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083027900] [2025-04-14 00:37:10,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:10,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:10,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:10,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:10,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:10,489 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:37:10,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:10,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:10,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:37:10,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:10,557 INFO L116 PetriNetUnfolderBase]: 12/35 cut-off events. [2025-04-14 00:37:10,557 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:37:10,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 35 events. 12/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 8 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 71. Up to 33 conditions per place. [2025-04-14 00:37:10,557 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 16 selfloop transitions, 4 changer transitions 0/20 dead transitions. [2025-04-14 00:37:10,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 94 flow [2025-04-14 00:37:10,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2025-04-14 00:37:10,559 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2025-04-14 00:37:10,559 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 52 flow. Second operand 4 states and 29 transitions. [2025-04-14 00:37:10,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 94 flow [2025-04-14 00:37:10,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 90 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:10,560 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 66 flow [2025-04-14 00:37:10,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-04-14 00:37:10,560 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2025-04-14 00:37:10,560 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 66 flow [2025-04-14 00:37:10,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:10,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:10,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:10,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:37:10,561 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:10,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash -421181322, now seen corresponding path program 1 times [2025-04-14 00:37:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:10,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084927730] [2025-04-14 00:37:10,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:10,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:37:10,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:37:10,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:10,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:10,724 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:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:10,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084927730] [2025-04-14 00:37:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084927730] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238247483] [2025-04-14 00:37:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:10,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:10,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:10,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:10,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:37:10,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:10,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:10,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:37:10,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:10,792 INFO L116 PetriNetUnfolderBase]: 12/36 cut-off events. [2025-04-14 00:37:10,793 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:37:10,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 36 events. 12/36 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 8 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 71. Up to 35 conditions per place. [2025-04-14 00:37:10,793 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 18 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2025-04-14 00:37:10,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 110 flow [2025-04-14 00:37:10,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-04-14 00:37:10,795 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:37:10,795 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 66 flow. Second operand 4 states and 28 transitions. [2025-04-14 00:37:10,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 110 flow [2025-04-14 00:37:10,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 109 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:10,796 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 79 flow [2025-04-14 00:37:10,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-04-14 00:37:10,796 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-04-14 00:37:10,796 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 79 flow [2025-04-14 00:37:10,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:10,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:10,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:10,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:37:10,797 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:10,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash 818783951, now seen corresponding path program 1 times [2025-04-14 00:37:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:10,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096049188] [2025-04-14 00:37:10,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:10,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:37:10,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:37:10,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:10,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:37:11,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:11,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096049188] [2025-04-14 00:37:11,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096049188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:37:11,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459630442] [2025-04-14 00:37:11,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:11,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:11,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:11,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:37:11,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:37:11,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:37:11,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:37:11,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:11,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:11,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 00:37:11,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:37:11,278 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:11,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:37:11,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459630442] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:11,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:37:11,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-04-14 00:37:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119840047] [2025-04-14 00:37:11,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:11,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:11,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:11,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:37:11,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:37:11,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:11,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:11,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:37:11,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:11,342 INFO L116 PetriNetUnfolderBase]: 12/37 cut-off events. [2025-04-14 00:37:11,342 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:37:11,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 37 events. 12/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 8 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 78. Up to 36 conditions per place. [2025-04-14 00:37:11,342 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2025-04-14 00:37:11,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 125 flow [2025-04-14 00:37:11,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-04-14 00:37:11,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:37:11,345 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 79 flow. Second operand 4 states and 28 transitions. [2025-04-14 00:37:11,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 125 flow [2025-04-14 00:37:11,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 119 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:11,345 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 87 flow [2025-04-14 00:37:11,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-04-14 00:37:11,346 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2025-04-14 00:37:11,346 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 87 flow [2025-04-14 00:37:11,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:11,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:11,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:11,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:37:11,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:11,547 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:11,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -275222484, now seen corresponding path program 1 times [2025-04-14 00:37:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:11,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343926338] [2025-04-14 00:37:11,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:11,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:37:11,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:37:11,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:11,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:12,681 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:12,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:12,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343926338] [2025-04-14 00:37:12,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343926338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:12,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:12,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543685068] [2025-04-14 00:37:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:12,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:12,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:12,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:12,682 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:37:12,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:12,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:12,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:37:12,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:12,783 INFO L116 PetriNetUnfolderBase]: 11/40 cut-off events. [2025-04-14 00:37:12,784 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:37:12,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 40 events. 11/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 1 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 87. Up to 21 conditions per place. [2025-04-14 00:37:12,784 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 22 selfloop transitions, 1 changer transitions 6/29 dead transitions. [2025-04-14 00:37:12,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 162 flow [2025-04-14 00:37:12,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-14 00:37:12,786 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-04-14 00:37:12,786 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 87 flow. Second operand 4 states and 34 transitions. [2025-04-14 00:37:12,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 162 flow [2025-04-14 00:37:12,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 156 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:12,787 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 88 flow [2025-04-14 00:37:12,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2025-04-14 00:37:12,788 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2025-04-14 00:37:12,788 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 88 flow [2025-04-14 00:37:12,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:12,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:12,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:12,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:37:12,788 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:12,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash -302629030, now seen corresponding path program 2 times [2025-04-14 00:37:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:12,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329515898] [2025-04-14 00:37:12,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:12,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 00:37:12,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 18 statements. [2025-04-14 00:37:12,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:12,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:13,431 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:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:13,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329515898] [2025-04-14 00:37:13,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329515898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:13,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:13,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:13,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739951005] [2025-04-14 00:37:13,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:13,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:13,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:13,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:13,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-14 00:37:13,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:13,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:13,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-14 00:37:13,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:13,541 INFO L116 PetriNetUnfolderBase]: 9/33 cut-off events. [2025-04-14 00:37:13,541 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-14 00:37:13,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 33 events. 9/33 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 3 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 94. Up to 26 conditions per place. [2025-04-14 00:37:13,542 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 0 selfloop transitions, 0 changer transitions 25/25 dead transitions. [2025-04-14 00:37:13,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 146 flow [2025-04-14 00:37:13,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-04-14 00:37:13,543 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-14 00:37:13,543 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 88 flow. Second operand 4 states and 30 transitions. [2025-04-14 00:37:13,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 146 flow [2025-04-14 00:37:13,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:13,544 INFO L231 Difference]: Finished difference. Result has 31 places, 0 transitions, 0 flow [2025-04-14 00:37:13,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=31, PETRI_TRANSITIONS=0} [2025-04-14 00:37:13,544 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2025-04-14 00:37:13,544 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 0 transitions, 0 flow [2025-04-14 00:37:13,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:13,548 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:37:13,549 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:37:13,549 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:37:13,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:37:13,549 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-04-14 00:37:13,552 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:37:13,552 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:37:13,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:37:13 BasicIcfg [2025-04-14 00:37:13,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:37:13,556 INFO L158 Benchmark]: Toolchain (without parser) took 5304.18ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 98.9MB in the beginning and 151.0MB in the end (delta: -52.1MB). Peak memory consumption was 88.4MB. Max. memory is 8.0GB. [2025-04-14 00:37:13,556 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:37:13,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.49ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 82.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 00:37:13,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.28ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:37:13,557 INFO L158 Benchmark]: Boogie Preprocessor took 46.95ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 77.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:37:13,558 INFO L158 Benchmark]: IcfgBuilder took 952.33ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 37.4MB in the end (delta: 40.2MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2025-04-14 00:37:13,558 INFO L158 Benchmark]: TraceAbstraction took 4005.46ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 36.7MB in the beginning and 151.0MB in the end (delta: -114.3MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. [2025-04-14 00:37:13,559 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 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.49ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 82.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.28ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 46.95ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 77.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 952.33ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 37.4MB in the end (delta: 40.2MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4005.46ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 36.7MB in the beginning and 151.0MB in the end (delta: -114.3MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: 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 5 procedures, 24 locations, 27 edges, 3 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: 3.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=5, InterpolantAutomatonStates: 23, 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, 2.5s InterpolantComputationTime, 115 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 697 SizeOfPredicates, 2 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 16/17 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:13,575 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...