/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:59:52,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:59:53,017 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-13 19:59:53,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:59:53,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:59:53,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:59:53,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:59:53,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:59:53,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:59:53,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:59:53,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:59:53,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:59:53,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:59:53,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:59:53,046 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:59:53,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:59:53,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:59:53,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:59:53,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:59:53,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:59:53,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:59:53,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:59:53,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:59:53,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:59:53,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:59:53,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:59:53,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:59:53,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:59:53,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:59:53,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:59:53,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:59:53,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:59:53,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:59:53,048 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 [2025-04-13 19:59:53,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:59:53,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:59:53,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:59:53,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:59:53,262 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:59:53,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2025-04-13 19:59:54,598 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91b7a534/40d0f0b32e4244d1af8142f7491d3fae/FLAG03ac659bf [2025-04-13 19:59:54,817 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:59:54,817 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2025-04-13 19:59:54,825 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91b7a534/40d0f0b32e4244d1af8142f7491d3fae/FLAG03ac659bf [2025-04-13 19:59:55,648 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91b7a534/40d0f0b32e4244d1af8142f7491d3fae [2025-04-13 19:59:55,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:59:55,651 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:59:55,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:59:55,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:59:55,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:59:55,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779eb074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55, skipping insertion in model container [2025-04-13 19:59:55,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:59:55,828 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-file-item-trans.wvr.c[2856,2869] [2025-04-13 19:59:55,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:59:55,848 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:59:55,872 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-file-item-trans.wvr.c[2856,2869] [2025-04-13 19:59:55,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:59:55,882 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:59:55,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55 WrapperNode [2025-04-13 19:59:55,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:59:55,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:59:55,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:59:55,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:59:55,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,920 INFO L138 Inliner]: procedures = 22, calls = 15, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 192 [2025-04-13 19:59:55,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:59:55,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:59:55,921 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:59:55,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:59:55,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,941 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:59:55,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:59:55,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:59:55,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:59:55,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:59:55,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (1/1) ... [2025-04-13 19:59:55,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:59:55,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:55,978 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-13 19:59:55,979 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-13 19:59:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:59:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:59:55,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:59:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:59:55,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:59:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:59:55,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:59:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:59:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:59:55,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:59:55,996 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:59:56,071 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:59:56,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:59:56,304 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:59:56,305 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:59:56,305 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:59:56,662 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:59:56,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:59:56 BoogieIcfgContainer [2025-04-13 19:59:56,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:59:56,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:59:56,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:59:56,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:59:56,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:59:55" (1/3) ... [2025-04-13 19:59:56,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cd6239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:59:56, skipping insertion in model container [2025-04-13 19:59:56,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:55" (2/3) ... [2025-04-13 19:59:56,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cd6239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:59:56, skipping insertion in model container [2025-04-13 19:59:56,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:59:56" (3/3) ... [2025-04-13 19:59:56,670 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2025-04-13 19:59:56,681 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:59:56,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-trans.wvr.c that has 4 procedures, 19 locations, 15 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:59:56,683 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:59:56,737 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 19:59:56,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 18 transitions, 57 flow [2025-04-13 19:59:56,787 INFO L116 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-04-13 19:59:56,789 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:59:56,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 15 events. 0/15 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 19:59:56,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 18 transitions, 57 flow [2025-04-13 19:59:56,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 14 transitions, 46 flow [2025-04-13 19:59:56,800 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:59:56,809 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;@482155e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:59:56,810 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:59:56,836 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:59:56,837 INFO L116 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-04-13 19:59:56,837 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:59:56,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:56,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:56,837 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-13 19:59:56,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:56,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1993335131, now seen corresponding path program 1 times [2025-04-13 19:59:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:56,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332572624] [2025-04-13 19:59:56,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:56,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:59:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:59:57,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:58,300 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-13 19:59:58,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:58,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332572624] [2025-04-13 19:59:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332572624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:58,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251833351] [2025-04-13 19:59:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:58,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:58,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:58,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:58,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:58,325 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 19:59:58,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 14 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 19:59:58,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:58,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 19:59:58,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:58,600 INFO L116 PetriNetUnfolderBase]: 32/83 cut-off events. [2025-04-13 19:59:58,600 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-13 19:59:58,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 83 events. 32/83 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 224 event pairs, 1 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 145. Up to 34 conditions per place. [2025-04-13 19:59:58,602 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 26 selfloop transitions, 6 changer transitions 5/37 dead transitions. [2025-04-13 19:59:58,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 37 transitions, 196 flow [2025-04-13 19:59:58,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:59:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:59:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2025-04-13 19:59:58,610 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-13 19:59:58,610 INFO L175 Difference]: Start difference. First operand has 24 places, 14 transitions, 46 flow. Second operand 6 states and 56 transitions. [2025-04-13 19:59:58,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 37 transitions, 196 flow [2025-04-13 19:59:58,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 19:59:58,615 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 67 flow [2025-04-13 19:59:58,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=67, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2025-04-13 19:59:58,619 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-04-13 19:59:58,619 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 67 flow [2025-04-13 19:59:58,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 19:59:58,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:58,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:58,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:59:58,619 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-13 19:59:58,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash 284085403, now seen corresponding path program 2 times [2025-04-13 19:59:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:58,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262800246] [2025-04-13 19:59:58,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:59:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:58,634 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:59:58,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:59:58,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:59:58,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:59,312 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-13 19:59:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:59,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262800246] [2025-04-13 19:59:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262800246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:59,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:59,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:59,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786397216] [2025-04-13 19:59:59,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:59,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:59,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:59,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:59,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:59,314 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 19:59:59,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 19:59:59,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:59,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 19:59:59,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:59,516 INFO L116 PetriNetUnfolderBase]: 32/97 cut-off events. [2025-04-13 19:59:59,516 INFO L117 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-04-13 19:59:59,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 97 events. 32/97 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 336 event pairs, 6 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 264. Up to 48 conditions per place. [2025-04-13 19:59:59,520 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 24 selfloop transitions, 9 changer transitions 3/36 dead transitions. [2025-04-13 19:59:59,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 36 transitions, 195 flow [2025-04-13 19:59:59,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2025-04-13 19:59:59,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2025-04-13 19:59:59,521 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 67 flow. Second operand 5 states and 49 transitions. [2025-04-13 19:59:59,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 36 transitions, 195 flow [2025-04-13 19:59:59,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 191 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:59,523 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 114 flow [2025-04-13 19:59:59,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2025-04-13 19:59:59,523 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2025-04-13 19:59:59,523 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 114 flow [2025-04-13 19:59:59,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 19:59:59,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:59,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:59,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:59:59,524 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-13 19:59:59,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash 312454123, now seen corresponding path program 3 times [2025-04-13 19:59:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:59,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7711044] [2025-04-13 19:59:59,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:59:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:59,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:59:59,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:59:59,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:59:59,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:00,328 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-13 20:00:00,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:00,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7711044] [2025-04-13 20:00:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7711044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:00,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455526123] [2025-04-13 20:00:00,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:00,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:00,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:00,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:00,329 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 20:00:00,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 20:00:00,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:00,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 20:00:00,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:00,608 INFO L116 PetriNetUnfolderBase]: 32/96 cut-off events. [2025-04-13 20:00:00,608 INFO L117 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-04-13 20:00:00,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 96 events. 32/96 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 327 event pairs, 6 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 196. Up to 44 conditions per place. [2025-04-13 20:00:00,610 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 19 selfloop transitions, 8 changer transitions 9/36 dead transitions. [2025-04-13 20:00:00,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 239 flow [2025-04-13 20:00:00,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:00:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:00:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-13 20:00:00,613 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-04-13 20:00:00,613 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 114 flow. Second operand 5 states and 47 transitions. [2025-04-13 20:00:00,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 239 flow [2025-04-13 20:00:00,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 232 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:00:00,615 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 118 flow [2025-04-13 20:00:00,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2025-04-13 20:00:00,616 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2025-04-13 20:00:00,616 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 118 flow [2025-04-13 20:00:00,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 20:00:00,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:00,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:00,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:00:00,616 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-13 20:00:00,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2022112927, now seen corresponding path program 4 times [2025-04-13 20:00:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:00,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464662219] [2025-04-13 20:00:00,617 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:00:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:00,629 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:00:00,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:00:00,640 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:00:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:00:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:01,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464662219] [2025-04-13 20:00:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464662219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:01,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616747098] [2025-04-13 20:00:01,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:01,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:01,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:01,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:01,186 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 20:00:01,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 20:00:01,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:01,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 20:00:01,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:01,391 INFO L116 PetriNetUnfolderBase]: 16/53 cut-off events. [2025-04-13 20:00:01,391 INFO L117 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-04-13 20:00:01,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 53 events. 16/53 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 1 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 162. Up to 18 conditions per place. [2025-04-13 20:00:01,392 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 16 selfloop transitions, 5 changer transitions 11/32 dead transitions. [2025-04-13 20:00:01,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 222 flow [2025-04-13 20:00:01,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:00:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:00:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2025-04-13 20:00:01,393 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-13 20:00:01,393 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 118 flow. Second operand 6 states and 48 transitions. [2025-04-13 20:00:01,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 222 flow [2025-04-13 20:00:01,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 184 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-04-13 20:00:01,394 INFO L231 Difference]: Finished difference. Result has 33 places, 17 transitions, 81 flow [2025-04-13 20:00:01,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=33, PETRI_TRANSITIONS=17} [2025-04-13 20:00:01,395 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2025-04-13 20:00:01,395 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 17 transitions, 81 flow [2025-04-13 20:00:01,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 20:00:01,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:01,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:01,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:00:01,395 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-13 20:00:01,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1191884443, now seen corresponding path program 5 times [2025-04-13 20:00:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:01,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386216298] [2025-04-13 20:00:01,396 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:00:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:01,404 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:00:01,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:00:01,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:00:01,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:01,862 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-13 20:00:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:01,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386216298] [2025-04-13 20:00:01,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386216298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:01,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:01,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968502695] [2025-04-13 20:00:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:01,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:01,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:01,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:01,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 20:00:01,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 17 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 20:00:01,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:01,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 20:00:01,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:02,041 INFO L116 PetriNetUnfolderBase]: 8/36 cut-off events. [2025-04-13 20:00:02,041 INFO L117 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-04-13 20:00:02,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 36 events. 8/36 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 119. Up to 17 conditions per place. [2025-04-13 20:00:02,041 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 13 selfloop transitions, 3 changer transitions 10/26 dead transitions. [2025-04-13 20:00:02,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 155 flow [2025-04-13 20:00:02,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:00:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:00:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2025-04-13 20:00:02,042 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-13 20:00:02,042 INFO L175 Difference]: Start difference. First operand has 33 places, 17 transitions, 81 flow. Second operand 6 states and 45 transitions. [2025-04-13 20:00:02,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 155 flow [2025-04-13 20:00:02,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 133 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-04-13 20:00:02,043 INFO L231 Difference]: Finished difference. Result has 31 places, 14 transitions, 51 flow [2025-04-13 20:00:02,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=51, PETRI_PLACES=31, PETRI_TRANSITIONS=14} [2025-04-13 20:00:02,044 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2025-04-13 20:00:02,044 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 14 transitions, 51 flow [2025-04-13 20:00:02,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 20:00:02,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:02,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:02,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:00:02,044 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-13 20:00:02,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:02,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2050758973, now seen corresponding path program 6 times [2025-04-13 20:00:02,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:02,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822400566] [2025-04-13 20:00:02,045 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:00:02,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:02,052 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:00:02,058 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:00:02,058 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:00:02,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:02,428 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-13 20:00:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:02,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822400566] [2025-04-13 20:00:02,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822400566] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:00:02,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:00:02,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:00:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642325614] [2025-04-13 20:00:02,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:00:02,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:00:02,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:02,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:00:02,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:00:02,430 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 20:00:02,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 14 transitions, 51 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 20:00:02,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:02,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 20:00:02,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:02,554 INFO L116 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-04-13 20:00:02,554 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:00:02,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 19 events. 3/19 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 58. Up to 7 conditions per place. [2025-04-13 20:00:02,554 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2025-04-13 20:00:02,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 16 transitions, 85 flow [2025-04-13 20:00:02,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:00:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:00:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2025-04-13 20:00:02,556 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2025-04-13 20:00:02,556 INFO L175 Difference]: Start difference. First operand has 31 places, 14 transitions, 51 flow. Second operand 6 states and 35 transitions. [2025-04-13 20:00:02,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 16 transitions, 85 flow [2025-04-13 20:00:02,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 16 transitions, 71 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-13 20:00:02,557 INFO L231 Difference]: Finished difference. Result has 26 places, 0 transitions, 0 flow [2025-04-13 20:00:02,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=26, PETRI_TRANSITIONS=0} [2025-04-13 20:00:02,557 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-04-13 20:00:02,557 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 0 transitions, 0 flow [2025-04-13 20:00:02,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 20:00:02,560 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:00:02,560 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:00:02,560 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:00:02,560 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:00:02,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:00:02,561 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-04-13 20:00:02,563 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:00:02,563 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:00:02,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:00:02 BasicIcfg [2025-04-13 20:00:02,568 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:00:02,568 INFO L158 Benchmark]: Toolchain (without parser) took 6916.65ms. Allocated memory was 155.2MB in the beginning and 448.8MB in the end (delta: 293.6MB). Free memory was 107.0MB in the beginning and 399.9MB in the end (delta: -292.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:02,568 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:02,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.85ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 91.9MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:00:02,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.77ms. Allocated memory is still 155.2MB. Free memory was 91.9MB in the beginning and 89.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:00:02,571 INFO L158 Benchmark]: Boogie Preprocessor took 30.61ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 87.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:00:02,571 INFO L158 Benchmark]: RCFGBuilder took 710.77ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 53.4MB in the end (delta: 33.6MB). Peak memory consumption was 69.7MB. Max. memory is 8.0GB. [2025-04-13 20:00:02,572 INFO L158 Benchmark]: TraceAbstraction took 5904.03ms. Allocated memory was 155.2MB in the beginning and 448.8MB in the end (delta: 293.6MB). Free memory was 52.6MB in the beginning and 399.9MB in the end (delta: -347.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:02,572 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.20ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.85ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 91.9MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.77ms. Allocated memory is still 155.2MB. Free memory was 91.9MB in the beginning and 89.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.61ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 87.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 710.77ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 53.4MB in the end (delta: 33.6MB). Peak memory consumption was 69.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5904.03ms. Allocated memory was 155.2MB in the beginning and 448.8MB in the end (delta: 293.6MB). Free memory was 52.6MB in the beginning and 399.9MB in the end (delta: -347.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: 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, 28 locations, 27 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: 5.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 0 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=3, InterpolantAutomatonStates: 34, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 1429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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-13 20:00:02,591 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...