/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/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:19:22,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:19:22,688 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:19:22,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:19:22,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:19:22,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:19:22,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:19:22,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:19:22,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:19:22,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:19:22,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:19:22,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:19:22,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:19:22,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:19:22,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:19:22,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:19:22,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:19:22,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:19:22,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:19:22,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:19:22,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:19:22,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:19:22,714 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:19:22,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:19:22,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:19:22,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:19:22,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:19:22,940 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:19:22,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2025-04-14 00:19:24,226 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f740e1a/02e74f11c9b54711ae027b0d8c0583b4/FLAG135e31dd1 [2025-04-14 00:19:24,416 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:19:24,417 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2025-04-14 00:19:24,422 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f740e1a/02e74f11c9b54711ae027b0d8c0583b4/FLAG135e31dd1 [2025-04-14 00:19:26,328 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f740e1a/02e74f11c9b54711ae027b0d8c0583b4 [2025-04-14 00:19:26,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:19:26,331 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:19:26,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:19:26,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:19:26,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:19:26,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2584be0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26, skipping insertion in model container [2025-04-14 00:19:26,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:19:26,510 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/bench-exp1x3.wvr.c[1875,1888] [2025-04-14 00:19:26,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:19:26,524 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:19:26,551 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/bench-exp1x3.wvr.c[1875,1888] [2025-04-14 00:19:26,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:19:26,564 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:19:26,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26 WrapperNode [2025-04-14 00:19:26,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:19:26,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:19:26,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:19:26,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:19:26,571 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:19:26" (1/1) ... [2025-04-14 00:19:26,579 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:19:26" (1/1) ... [2025-04-14 00:19:26,594 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2025-04-14 00:19:26,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:19:26,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:19:26,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:19:26,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:19:26,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,621 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:19:26,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:19:26,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:19:26,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:19:26,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:19:26,636 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (1/1) ... [2025-04-14 00:19:26,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:19:26,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:26,662 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:19:26,668 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:19:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:19:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:19:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:19:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:19:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:19:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:19:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:19:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:19:26,686 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:19:26,747 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:19:26,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:19:26,837 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:19:26,838 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:19:26,838 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:19:26,941 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:19:26,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:19:26 BoogieIcfgContainer [2025-04-14 00:19:26,943 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:19:26,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:19:26,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:19:26,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:19:26,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:19:26" (1/3) ... [2025-04-14 00:19:26,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6595dfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:19:26, skipping insertion in model container [2025-04-14 00:19:26,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:19:26" (2/3) ... [2025-04-14 00:19:26,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6595dfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:19:26, skipping insertion in model container [2025-04-14 00:19:26,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:19:26" (3/3) ... [2025-04-14 00:19:26,950 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2025-04-14 00:19:26,961 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:19:26,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp1x3.wvr.c that has 3 procedures, 16 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 00:19:26,962 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:19:26,999 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:19:27,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 17 transitions, 48 flow [2025-04-14 00:19:27,056 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-14 00:19:27,062 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:19:27,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 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/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-14 00:19:27,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 17 transitions, 48 flow [2025-04-14 00:19:27,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2025-04-14 00:19:27,075 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:19:27,088 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;@1a8d8261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:19:27,088 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:19:27,096 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:19:27,097 INFO L116 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-04-14 00:19:27,097 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:19:27,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:27,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:27,098 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:19:27,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1050153564, now seen corresponding path program 1 times [2025-04-14 00:19:27,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:27,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028051361] [2025-04-14 00:19:27,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:27,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:27,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:19:27,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:19:27,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:27,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:27,369 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:19:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:27,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028051361] [2025-04-14 00:19:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028051361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:27,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:27,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:19:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923763769] [2025-04-14 00:19:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:27,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:19:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:27,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:19:27,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:19:27,401 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:19:27,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:27,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:27,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:19:27,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:27,462 INFO L116 PetriNetUnfolderBase]: 59/103 cut-off events. [2025-04-14 00:19:27,462 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-14 00:19:27,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 103 events. 59/103 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 281 event pairs, 8 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 179. Up to 77 conditions per place. [2025-04-14 00:19:27,464 INFO L140 encePairwiseOnDemand]: 13/17 looper letters, 17 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2025-04-14 00:19:27,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 23 transitions, 109 flow [2025-04-14 00:19:27,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:19:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:19:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-14 00:19:27,474 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-14 00:19:27,475 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 40 flow. Second operand 3 states and 34 transitions. [2025-04-14 00:19:27,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 23 transitions, 109 flow [2025-04-14 00:19:27,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 23 transitions, 95 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:19:27,484 INFO L231 Difference]: Finished difference. Result has 18 places, 16 transitions, 51 flow [2025-04-14 00:19:27,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=18, PETRI_TRANSITIONS=16} [2025-04-14 00:19:27,489 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2025-04-14 00:19:27,489 INFO L485 AbstractCegarLoop]: Abstraction has has 18 places, 16 transitions, 51 flow [2025-04-14 00:19:27,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:27,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:27,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:27,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:19:27,490 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:19:27,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1257327450, now seen corresponding path program 1 times [2025-04-14 00:19:27,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:27,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854501148] [2025-04-14 00:19:27,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:27,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:27,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 00:19:27,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:19:27,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:27,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:27,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:27,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854501148] [2025-04-14 00:19:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854501148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:27,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:27,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:19:27,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938321081] [2025-04-14 00:19:27,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:27,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:19:27,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:27,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:19:27,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:19:27,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:19:27,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:19:27,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:27,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:19:27,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:27,728 INFO L116 PetriNetUnfolderBase]: 57/100 cut-off events. [2025-04-14 00:19:27,728 INFO L117 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-04-14 00:19:27,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 100 events. 57/100 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 244 event pairs, 1 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 72. Up to 38 conditions per place. [2025-04-14 00:19:27,731 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 22 selfloop transitions, 6 changer transitions 4/34 dead transitions. [2025-04-14 00:19:27,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 34 transitions, 161 flow [2025-04-14 00:19:27,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:19:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:19:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-04-14 00:19:27,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2025-04-14 00:19:27,733 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 51 flow. Second operand 5 states and 53 transitions. [2025-04-14 00:19:27,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 34 transitions, 161 flow [2025-04-14 00:19:27,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:27,734 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 72 flow [2025-04-14 00:19:27,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=22, PETRI_TRANSITIONS=18} [2025-04-14 00:19:27,734 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 3 predicate places. [2025-04-14 00:19:27,734 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 18 transitions, 72 flow [2025-04-14 00:19:27,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:19:27,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:27,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:27,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:19:27,735 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:19:27,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash -952652275, now seen corresponding path program 1 times [2025-04-14 00:19:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:27,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778351730] [2025-04-14 00:19:27,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:27,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:27,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 00:19:27,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:19:27,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:27,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:27,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:27,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778351730] [2025-04-14 00:19:27,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778351730] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:27,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:27,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:19:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260421443] [2025-04-14 00:19:27,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:27,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:19:27,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:27,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:19:27,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:19:27,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:19:27,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:19:27,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:27,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:19:27,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:27,900 INFO L116 PetriNetUnfolderBase]: 51/92 cut-off events. [2025-04-14 00:19:27,900 INFO L117 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-04-14 00:19:27,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 92 events. 51/92 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 224 event pairs, 1 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 79. Up to 46 conditions per place. [2025-04-14 00:19:27,901 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 17 selfloop transitions, 4 changer transitions 7/30 dead transitions. [2025-04-14 00:19:27,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 30 transitions, 159 flow [2025-04-14 00:19:27,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:19:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:19:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2025-04-14 00:19:27,907 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5764705882352941 [2025-04-14 00:19:27,907 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 72 flow. Second operand 5 states and 49 transitions. [2025-04-14 00:19:27,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 30 transitions, 159 flow [2025-04-14 00:19:27,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:27,908 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 66 flow [2025-04-14 00:19:27,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2025-04-14 00:19:27,909 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 6 predicate places. [2025-04-14 00:19:27,909 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 66 flow [2025-04-14 00:19:27,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:19:27,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:27,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:27,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:19:27,910 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:19:27,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2090459938, now seen corresponding path program 2 times [2025-04-14 00:19:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:27,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661382039] [2025-04-14 00:19:27,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:27,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:19:27,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:19:27,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:27,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:28,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:28,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661382039] [2025-04-14 00:19:28,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661382039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:28,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126778775] [2025-04-14 00:19:28,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:28,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:28,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:28,009 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:19:28,010 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:19:28,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:19:28,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:19:28,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:28,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:28,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:19:28,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:28,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126778775] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:28,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:28,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:19:28,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984750341] [2025-04-14 00:19:28,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:28,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:19:28,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:28,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:19:28,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:19:28,241 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:19:28,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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:19:28,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:28,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:19:28,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:28,342 INFO L116 PetriNetUnfolderBase]: 41/73 cut-off events. [2025-04-14 00:19:28,342 INFO L117 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-04-14 00:19:28,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 73 events. 41/73 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 3 based on Foata normal form. 5/77 useless extension candidates. Maximal degree in co-relation 71. Up to 48 conditions per place. [2025-04-14 00:19:28,343 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 20 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2025-04-14 00:19:28,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 153 flow [2025-04-14 00:19:28,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:19:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:19:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-04-14 00:19:28,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5647058823529412 [2025-04-14 00:19:28,344 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 66 flow. Second operand 5 states and 48 transitions. [2025-04-14 00:19:28,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 153 flow [2025-04-14 00:19:28,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 143 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:19:28,345 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 93 flow [2025-04-14 00:19:28,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2025-04-14 00:19:28,345 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 8 predicate places. [2025-04-14 00:19:28,345 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 93 flow [2025-04-14 00:19:28,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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:19:28,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:28,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:28,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:19:28,546 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:19:28,546 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:19:28,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1440010171, now seen corresponding path program 2 times [2025-04-14 00:19:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:28,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022787349] [2025-04-14 00:19:28,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:28,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:28,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:19:28,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:19:28,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:28,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:28,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:28,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022787349] [2025-04-14 00:19:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022787349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:28,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824500852] [2025-04-14 00:19:28,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:19:28,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:28,627 INFO L229 MonitoredProcess]: Starting monitored process 3 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:19:28,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:19:28,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:19:28,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:19:28,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:19:28,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:28,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:19:28,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:28,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:19:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824500852] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:28,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:28,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:19:28,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677411591] [2025-04-14 00:19:28,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:28,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:19:28,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:28,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:19:28,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:19:28,797 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:19:28,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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:19:28,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:28,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:19:28,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:28,866 INFO L116 PetriNetUnfolderBase]: 37/69 cut-off events. [2025-04-14 00:19:28,866 INFO L117 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-04-14 00:19:28,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 69 events. 37/69 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 2 based on Foata normal form. 4/72 useless extension candidates. Maximal degree in co-relation 121. Up to 55 conditions per place. [2025-04-14 00:19:28,867 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 20 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2025-04-14 00:19:28,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 178 flow [2025-04-14 00:19:28,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:19:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:19:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2025-04-14 00:19:28,869 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-04-14 00:19:28,869 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 93 flow. Second operand 5 states and 45 transitions. [2025-04-14 00:19:28,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 178 flow [2025-04-14 00:19:28,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 173 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:28,870 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 129 flow [2025-04-14 00:19:28,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2025-04-14 00:19:28,870 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 13 predicate places. [2025-04-14 00:19:28,871 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 129 flow [2025-04-14 00:19:28,871 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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:19:28,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:28,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:28,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:19:29,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:29,071 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:19:29,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash -824938927, now seen corresponding path program 1 times [2025-04-14 00:19:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:29,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117176530] [2025-04-14 00:19:29,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:29,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:29,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:19:29,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:19:29,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:29,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:29,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:29,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117176530] [2025-04-14 00:19:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117176530] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:29,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931706150] [2025-04-14 00:19:29,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:29,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:29,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:29,409 INFO L229 MonitoredProcess]: Starting monitored process 4 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:19:29,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:19:29,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:19:29,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:19:29,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:29,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:29,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:19:29,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:19:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:19:51,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931706150] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:02,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-04-14 00:20:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279293752] [2025-04-14 00:20:02,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:02,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:20:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:02,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:20:02,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=117, Unknown=6, NotChecked=0, Total=156 [2025-04-14 00:20:02,700 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:20:02,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 129 flow. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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:20:02,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:02,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:20:02,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:08,166 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:23,066 WARN L286 SmtUtils]: Spent 14.51s on a formula simplification. DAG size of input: 63 DAG size of output: 42 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:20:25,695 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:27,328 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:28,751 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:30,509 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:34,233 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:36,096 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:39,964 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:41,758 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:42,841 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:20:51,758 INFO L116 PetriNetUnfolderBase]: 100/187 cut-off events. [2025-04-14 00:20:51,758 INFO L117 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2025-04-14 00:20:51,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 187 events. 100/187 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 583 event pairs, 6 based on Foata normal form. 2/188 useless extension candidates. Maximal degree in co-relation 488. Up to 80 conditions per place. [2025-04-14 00:20:51,760 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 45 selfloop transitions, 17 changer transitions 3/67 dead transitions. [2025-04-14 00:20:51,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 67 transitions, 483 flow [2025-04-14 00:20:51,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:20:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:20:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2025-04-14 00:20:51,761 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6143790849673203 [2025-04-14 00:20:51,761 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 129 flow. Second operand 9 states and 94 transitions. [2025-04-14 00:20:51,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 67 transitions, 483 flow [2025-04-14 00:20:51,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 67 transitions, 468 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 00:20:51,764 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 284 flow [2025-04-14 00:20:51,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=284, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-04-14 00:20:51,764 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 25 predicate places. [2025-04-14 00:20:51,765 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 284 flow [2025-04-14 00:20:51,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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:20:51,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:20:51,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:20:51,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:20:51,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:51,969 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:20:51,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:20:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1019653689, now seen corresponding path program 2 times [2025-04-14 00:20:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:20:51,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102111481] [2025-04-14 00:20:51,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:20:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:20:51,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:20:51,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:20:51,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:20:51,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:20:52,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102111481] [2025-04-14 00:20:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102111481] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:20:52,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094912906] [2025-04-14 00:20:52,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:20:52,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:20:52,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:20:52,174 INFO L229 MonitoredProcess]: Starting monitored process 5 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:20:52,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:20:52,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:20:52,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:20:52,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:20:52,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:20:52,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:20:52,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:20:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:53,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:20:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:20:54,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094912906] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:20:54,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:20:54,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-14 00:20:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268121267] [2025-04-14 00:20:54,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:20:54,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:20:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:20:54,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:20:54,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:20:54,259 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:20:54,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 284 flow. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 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:20:54,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:20:54,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:20:54,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:20:58,136 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:21:00,253 INFO L116 PetriNetUnfolderBase]: 220/421 cut-off events. [2025-04-14 00:21:00,253 INFO L117 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2025-04-14 00:21:00,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 421 events. 220/421 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1777 event pairs, 8 based on Foata normal form. 12/432 useless extension candidates. Maximal degree in co-relation 1812. Up to 176 conditions per place. [2025-04-14 00:21:00,256 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 71 selfloop transitions, 42 changer transitions 13/128 dead transitions. [2025-04-14 00:21:00,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 128 transitions, 1109 flow [2025-04-14 00:21:00,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:21:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:21:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 179 transitions. [2025-04-14 00:21:00,258 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5849673202614379 [2025-04-14 00:21:00,259 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 284 flow. Second operand 18 states and 179 transitions. [2025-04-14 00:21:00,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 128 transitions, 1109 flow [2025-04-14 00:21:00,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 128 transitions, 1066 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-04-14 00:21:00,268 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 715 flow [2025-04-14 00:21:00,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=715, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-04-14 00:21:00,269 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 54 predicate places. [2025-04-14 00:21:00,269 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 715 flow [2025-04-14 00:21:00,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 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:21:00,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:00,269 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:00,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:21:00,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:00,470 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:00,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:00,470 INFO L85 PathProgramCache]: Analyzing trace with hash 199314765, now seen corresponding path program 3 times [2025-04-14 00:21:00,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:00,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68421195] [2025-04-14 00:21:00,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:21:00,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:00,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:21:00,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:21:00,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:21:00,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:00,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68421195] [2025-04-14 00:21:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68421195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:00,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694459714] [2025-04-14 00:21:00,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:21:00,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:00,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:00,573 INFO L229 MonitoredProcess]: Starting monitored process 6 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:21:00,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:21:00,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:21:01,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:21:01,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:21:01,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:01,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 00:21:01,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:02,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:06,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694459714] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:06,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:06,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-14 00:21:06,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243808305] [2025-04-14 00:21:06,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:06,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:21:06,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:06,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:21:06,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:21:06,018 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:21:06,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 715 flow. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 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:21:06,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:06,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:21:06,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:15,073 INFO L116 PetriNetUnfolderBase]: 309/624 cut-off events. [2025-04-14 00:21:15,073 INFO L117 PetriNetUnfolderBase]: For 6948/6948 co-relation queries the response was YES. [2025-04-14 00:21:15,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3856 conditions, 624 events. 309/624 cut-off events. For 6948/6948 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3165 event pairs, 12 based on Foata normal form. 28/651 useless extension candidates. Maximal degree in co-relation 3681. Up to 199 conditions per place. [2025-04-14 00:21:15,079 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 100 selfloop transitions, 61 changer transitions 4/167 dead transitions. [2025-04-14 00:21:15,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 167 transitions, 1886 flow [2025-04-14 00:21:15,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:21:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:21:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 185 transitions. [2025-04-14 00:21:15,081 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6045751633986928 [2025-04-14 00:21:15,081 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 715 flow. Second operand 18 states and 185 transitions. [2025-04-14 00:21:15,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 167 transitions, 1886 flow [2025-04-14 00:21:15,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 167 transitions, 1703 flow, removed 90 selfloop flow, removed 2 redundant places. [2025-04-14 00:21:15,095 INFO L231 Difference]: Finished difference. Result has 100 places, 105 transitions, 1248 flow [2025-04-14 00:21:15,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1248, PETRI_PLACES=100, PETRI_TRANSITIONS=105} [2025-04-14 00:21:15,096 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 81 predicate places. [2025-04-14 00:21:15,096 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 1248 flow [2025-04-14 00:21:15,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 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:21:15,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:15,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:15,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 00:21:15,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:15,298 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:15,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1111613950, now seen corresponding path program 4 times [2025-04-14 00:21:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:15,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990561430] [2025-04-14 00:21:15,298 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:21:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:15,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:21:15,309 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:21:15,309 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:21:15,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:15,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990561430] [2025-04-14 00:21:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990561430] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:15,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152899952] [2025-04-14 00:21:15,387 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:21:15,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:15,390 INFO L229 MonitoredProcess]: Starting monitored process 7 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:21:15,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 00:21:15,416 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:21:15,432 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:21:15,432 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:21:15,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:15,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:21:15,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:15,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:15,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152899952] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:15,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:15,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 00:21:15,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393522165] [2025-04-14 00:21:15,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:15,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:21:15,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:15,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:21:15,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:21:15,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:21:15,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 1248 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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:21:15,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:15,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:21:15,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:15,967 INFO L116 PetriNetUnfolderBase]: 290/597 cut-off events. [2025-04-14 00:21:15,968 INFO L117 PetriNetUnfolderBase]: For 11565/11565 co-relation queries the response was YES. [2025-04-14 00:21:15,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 597 events. 290/597 cut-off events. For 11565/11565 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3050 event pairs, 13 based on Foata normal form. 11/607 useless extension candidates. Maximal degree in co-relation 4078. Up to 289 conditions per place. [2025-04-14 00:21:15,984 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 115 selfloop transitions, 16 changer transitions 23/156 dead transitions. [2025-04-14 00:21:15,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 156 transitions, 2156 flow [2025-04-14 00:21:15,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:21:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:21:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2025-04-14 00:21:15,985 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5347593582887701 [2025-04-14 00:21:15,985 INFO L175 Difference]: Start difference. First operand has 100 places, 105 transitions, 1248 flow. Second operand 11 states and 100 transitions. [2025-04-14 00:21:15,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 156 transitions, 2156 flow [2025-04-14 00:21:16,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 156 transitions, 1723 flow, removed 211 selfloop flow, removed 4 redundant places. [2025-04-14 00:21:16,010 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 984 flow [2025-04-14 00:21:16,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=984, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2025-04-14 00:21:16,012 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 89 predicate places. [2025-04-14 00:21:16,012 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 984 flow [2025-04-14 00:21:16,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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:21:16,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:16,012 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:16,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 00:21:16,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:16,216 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:16,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1470730768, now seen corresponding path program 5 times [2025-04-14 00:21:16,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:16,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51891670] [2025-04-14 00:21:16,217 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:21:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:16,220 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:21:16,223 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:21:16,223 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:16,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:16,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51891670] [2025-04-14 00:21:16,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51891670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:16,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254221059] [2025-04-14 00:21:16,284 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:21:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:16,286 INFO L229 MonitoredProcess]: Starting monitored process 8 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:21:16,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 00:21:16,308 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:21:16,327 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:21:16,328 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:16,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:16,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:21:16,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:19,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:19,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254221059] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:19,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:19,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 00:21:19,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532510722] [2025-04-14 00:21:19,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:19,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:21:19,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:19,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:21:19,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:21:19,566 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:21:19,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 984 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 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:21:19,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:19,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:21:19,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:20,449 INFO L116 PetriNetUnfolderBase]: 279/550 cut-off events. [2025-04-14 00:21:20,449 INFO L117 PetriNetUnfolderBase]: For 9813/9813 co-relation queries the response was YES. [2025-04-14 00:21:20,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3532 conditions, 550 events. 279/550 cut-off events. For 9813/9813 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2598 event pairs, 23 based on Foata normal form. 16/565 useless extension candidates. Maximal degree in co-relation 3259. Up to 478 conditions per place. [2025-04-14 00:21:20,454 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 96 selfloop transitions, 29 changer transitions 0/127 dead transitions. [2025-04-14 00:21:20,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 127 transitions, 1433 flow [2025-04-14 00:21:20,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:21:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:21:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2025-04-14 00:21:20,455 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48663101604278075 [2025-04-14 00:21:20,455 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 984 flow. Second operand 11 states and 91 transitions. [2025-04-14 00:21:20,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 127 transitions, 1433 flow [2025-04-14 00:21:20,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 127 transitions, 1337 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-04-14 00:21:20,474 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 1121 flow [2025-04-14 00:21:20,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1121, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2025-04-14 00:21:20,476 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 89 predicate places. [2025-04-14 00:21:20,476 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 1121 flow [2025-04-14 00:21:20,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 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:21:20,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:20,476 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:21:20,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-14 00:21:20,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:20,677 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:21:20,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1659013855, now seen corresponding path program 6 times [2025-04-14 00:21:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:20,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706376030] [2025-04-14 00:21:20,678 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:21:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:20,681 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:21:20,684 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:21:20,684 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:21:20,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:20,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706376030] [2025-04-14 00:21:20,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706376030] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:20,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177706901] [2025-04-14 00:21:20,758 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:21:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:20,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:20,760 INFO L229 MonitoredProcess]: Starting monitored process 9 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:21:20,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 00:21:20,785 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:21:21,112 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:21:21,112 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:21:21,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:21,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 00:21:21,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:04,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:22:28,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177706901] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:28,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:28,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-14 00:22:28,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17326457] [2025-04-14 00:22:28,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:28,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:22:28,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:28,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:22:28,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=172, Unknown=10, NotChecked=0, Total=240 [2025-04-14 00:22:28,876 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:22:28,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 1121 flow. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 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:22:28,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:28,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:22:28,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:37,592 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:22:42,635 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:22:55,095 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:22:56,546 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:02,059 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:10,384 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:14,500 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:18,503 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:22,505 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:26,633 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:30,637 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:35,265 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:38,124 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:39,855 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:43,893 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:47,896 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:52,628 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:23:56,630 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:00,632 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:04,634 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:08,637 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:12,639 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:18,800 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:21,156 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:26,848 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:30,490 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:35,151 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:39,153 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:43,155 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:43,394 INFO L116 PetriNetUnfolderBase]: 376/754 cut-off events. [2025-04-14 00:24:43,394 INFO L117 PetriNetUnfolderBase]: For 17877/17877 co-relation queries the response was YES. [2025-04-14 00:24:43,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 754 events. 376/754 cut-off events. For 17877/17877 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3934 event pairs, 24 based on Foata normal form. 19/772 useless extension candidates. Maximal degree in co-relation 4960. Up to 396 conditions per place. [2025-04-14 00:24:43,399 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 127 selfloop transitions, 60 changer transitions 7/196 dead transitions. [2025-04-14 00:24:43,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 196 transitions, 2442 flow [2025-04-14 00:24:43,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:24:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:24:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 183 transitions. [2025-04-14 00:24:43,401 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.56656346749226 [2025-04-14 00:24:43,401 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 1121 flow. Second operand 19 states and 183 transitions. [2025-04-14 00:24:43,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 196 transitions, 2442 flow [2025-04-14 00:24:43,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 196 transitions, 2338 flow, removed 40 selfloop flow, removed 5 redundant places. [2025-04-14 00:24:43,438 INFO L231 Difference]: Finished difference. Result has 130 places, 135 transitions, 1566 flow [2025-04-14 00:24:43,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1566, PETRI_PLACES=130, PETRI_TRANSITIONS=135} [2025-04-14 00:24:43,440 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 111 predicate places. [2025-04-14 00:24:43,440 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 135 transitions, 1566 flow [2025-04-14 00:24:43,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 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:24:43,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:43,440 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:43,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 00:24:43,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-14 00:24:43,641 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:24:43,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1871380969, now seen corresponding path program 7 times [2025-04-14 00:24:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:43,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286211210] [2025-04-14 00:24:43,641 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:24:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:43,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:24:43,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:24:43,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:43,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:43,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:43,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286211210] [2025-04-14 00:24:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286211210] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:24:43,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265383401] [2025-04-14 00:24:43,709 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:24:43,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:43,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:24:43,711 INFO L229 MonitoredProcess]: Starting monitored process 10 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:24:43,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 00:24:43,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:24:43,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:24:43,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:43,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:43,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:24:43,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:24:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:44,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:24:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:44,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265383401] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:24:44,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:24:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 00:24:44,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726311399] [2025-04-14 00:24:44,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:24:44,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:24:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:44,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:24:44,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:24:44,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:24:44,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 135 transitions, 1566 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 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:24:44,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:44,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:24:44,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:48,343 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:51,627 INFO L116 PetriNetUnfolderBase]: 342/686 cut-off events. [2025-04-14 00:24:51,627 INFO L117 PetriNetUnfolderBase]: For 20649/20649 co-relation queries the response was YES. [2025-04-14 00:24:51,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 686 events. 342/686 cut-off events. For 20649/20649 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3478 event pairs, 23 based on Foata normal form. 16/701 useless extension candidates. Maximal degree in co-relation 5148. Up to 326 conditions per place. [2025-04-14 00:24:51,633 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 120 selfloop transitions, 35 changer transitions 18/175 dead transitions. [2025-04-14 00:24:51,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 175 transitions, 2395 flow [2025-04-14 00:24:51,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 00:24:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 00:24:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 116 transitions. [2025-04-14 00:24:51,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48739495798319327 [2025-04-14 00:24:51,633 INFO L175 Difference]: Start difference. First operand has 130 places, 135 transitions, 1566 flow. Second operand 14 states and 116 transitions. [2025-04-14 00:24:51,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 175 transitions, 2395 flow [2025-04-14 00:24:51,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 175 transitions, 2187 flow, removed 93 selfloop flow, removed 6 redundant places. [2025-04-14 00:24:51,667 INFO L231 Difference]: Finished difference. Result has 139 places, 132 transitions, 1487 flow [2025-04-14 00:24:51,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1487, PETRI_PLACES=139, PETRI_TRANSITIONS=132} [2025-04-14 00:24:51,667 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 120 predicate places. [2025-04-14 00:24:51,668 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 132 transitions, 1487 flow [2025-04-14 00:24:51,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 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:24:51,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:51,668 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:51,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 00:24:51,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:51,868 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:24:51,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1772431310, now seen corresponding path program 8 times [2025-04-14 00:24:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:51,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058848770] [2025-04-14 00:24:51,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:24:51,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:51,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:24:51,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:24:51,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:24:51,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:52,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:52,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058848770] [2025-04-14 00:24:52,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058848770] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:24:52,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685297739] [2025-04-14 00:24:52,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:24:52,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:52,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:24:52,071 INFO L229 MonitoredProcess]: Starting monitored process 11 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:24:52,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 00:24:52,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:24:52,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:24:52,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:24:52,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:52,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 00:24:52,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:24:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:53,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:24:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685297739] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:24:54,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:24:54,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2025-04-14 00:24:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251963215] [2025-04-14 00:24:54,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:24:54,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:24:54,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:54,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:24:54,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:24:54,195 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:24:54,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 132 transitions, 1487 flow. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:54,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:54,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:24:54,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:58,463 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:25:11,296 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:25:13,706 INFO L116 PetriNetUnfolderBase]: 480/937 cut-off events. [2025-04-14 00:25:13,707 INFO L117 PetriNetUnfolderBase]: For 34643/34643 co-relation queries the response was YES. [2025-04-14 00:25:13,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7631 conditions, 937 events. 480/937 cut-off events. For 34643/34643 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5089 event pairs, 31 based on Foata normal form. 16/952 useless extension candidates. Maximal degree in co-relation 7223. Up to 537 conditions per place. [2025-04-14 00:25:13,714 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 156 selfloop transitions, 88 changer transitions 8/254 dead transitions. [2025-04-14 00:25:13,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 254 transitions, 3634 flow [2025-04-14 00:25:13,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:25:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:25:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 204 transitions. [2025-04-14 00:25:13,715 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-04-14 00:25:13,715 INFO L175 Difference]: Start difference. First operand has 139 places, 132 transitions, 1487 flow. Second operand 21 states and 204 transitions. [2025-04-14 00:25:13,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 254 transitions, 3634 flow [2025-04-14 00:25:13,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 254 transitions, 3320 flow, removed 119 selfloop flow, removed 9 redundant places. [2025-04-14 00:25:13,758 INFO L231 Difference]: Finished difference. Result has 160 places, 186 transitions, 2469 flow [2025-04-14 00:25:13,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2469, PETRI_PLACES=160, PETRI_TRANSITIONS=186} [2025-04-14 00:25:13,758 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 141 predicate places. [2025-04-14 00:25:13,758 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 186 transitions, 2469 flow [2025-04-14 00:25:13,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:25:13,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:25:13,758 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:25:13,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 00:25:13,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 00:25:13,959 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:25:13,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:25:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1728551120, now seen corresponding path program 9 times [2025-04-14 00:25:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:25:13,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096423821] [2025-04-14 00:25:13,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:25:13,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:25:13,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-14 00:25:13,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:25:13,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:25:13,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:25:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:25:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:25:14,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096423821] [2025-04-14 00:25:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096423821] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:25:14,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159049103] [2025-04-14 00:25:14,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:25:14,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:25:14,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:25:14,138 INFO L229 MonitoredProcess]: Starting monitored process 12 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:25:14,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 00:25:14,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-14 00:25:14,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:25:14,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:25:14,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:25:14,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:25:14,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:26:19,080 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:26:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:35,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:26:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159049103] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:26:54,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:26:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-14 00:26:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423464170] [2025-04-14 00:26:54,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:26:54,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:26:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:54,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:26:54,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=329, Unknown=13, NotChecked=0, Total=420 [2025-04-14 00:26:54,974 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:26:54,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 186 transitions, 2469 flow. Second operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 21 states have internal predecessors, (118), 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:26:54,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:54,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:26:54,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:27:01,211 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:08,809 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:14,005 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:31,696 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:35,702 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:39,941 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:43,943 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:47,948 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:04,373 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:12,187 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:16,335 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:16,587 INFO L116 PetriNetUnfolderBase]: 845/1687 cut-off events. [2025-04-14 00:28:16,587 INFO L117 PetriNetUnfolderBase]: For 97258/97258 co-relation queries the response was YES. [2025-04-14 00:28:16,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16547 conditions, 1687 events. 845/1687 cut-off events. For 97258/97258 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 10905 event pairs, 51 based on Foata normal form. 21/1707 useless extension candidates. Maximal degree in co-relation 16264. Up to 576 conditions per place. [2025-04-14 00:28:16,601 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 233 selfloop transitions, 176 changer transitions 24/435 dead transitions. [2025-04-14 00:28:16,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 435 transitions, 7286 flow [2025-04-14 00:28:16,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 00:28:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-14 00:28:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 331 transitions. [2025-04-14 00:28:16,602 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6084558823529411 [2025-04-14 00:28:16,602 INFO L175 Difference]: Start difference. First operand has 160 places, 186 transitions, 2469 flow. Second operand 32 states and 331 transitions. [2025-04-14 00:28:16,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 435 transitions, 7286 flow [2025-04-14 00:28:16,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 435 transitions, 6714 flow, removed 280 selfloop flow, removed 5 redundant places. [2025-04-14 00:28:16,779 INFO L231 Difference]: Finished difference. Result has 198 places, 284 transitions, 4263 flow [2025-04-14 00:28:16,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=4263, PETRI_PLACES=198, PETRI_TRANSITIONS=284} [2025-04-14 00:28:16,780 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 179 predicate places. [2025-04-14 00:28:16,780 INFO L485 AbstractCegarLoop]: Abstraction has has 198 places, 284 transitions, 4263 flow [2025-04-14 00:28:16,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 21 states have internal predecessors, (118), 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:28:16,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:28:16,780 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:28:16,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 00:28:16,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-14 00:28:16,981 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:28:16,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:28:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash 4688944, now seen corresponding path program 10 times [2025-04-14 00:28:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:28:16,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663251681] [2025-04-14 00:28:16,981 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:28:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:28:16,983 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 00:28:16,993 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:28:16,993 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:28:16,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:28:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:28:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:28:18,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663251681] [2025-04-14 00:28:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663251681] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:28:18,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254565682] [2025-04-14 00:28:18,005 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:28:18,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:28:18,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:28:18,006 INFO L229 MonitoredProcess]: Starting monitored process 13 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:28:18,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 00:28:18,032 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 00:28:18,166 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:28:18,166 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:28:18,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:28:18,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 00:28:18,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:28:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:28:26,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:28:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:28:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254565682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:28:27,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:28:27,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2025-04-14 00:28:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739494799] [2025-04-14 00:28:27,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:28:27,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:28:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:28:27,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:28:27,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:28:27,390 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:28:27,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 284 transitions, 4263 flow. Second operand has 17 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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:28:27,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:28:27,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:28:27,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:28:36,791 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 62 DAG size of output: 53 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:28:39,292 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:47,134 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:52,847 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:56,413 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:57,339 INFO L116 PetriNetUnfolderBase]: 834/1653 cut-off events. [2025-04-14 00:28:57,340 INFO L117 PetriNetUnfolderBase]: For 102825/102825 co-relation queries the response was YES. [2025-04-14 00:28:57,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17191 conditions, 1653 events. 834/1653 cut-off events. For 102825/102825 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 10526 event pairs, 100 based on Foata normal form. 3/1655 useless extension candidates. Maximal degree in co-relation 17100. Up to 1222 conditions per place. [2025-04-14 00:28:57,356 INFO L140 encePairwiseOnDemand]: 13/17 looper letters, 236 selfloop transitions, 81 changer transitions 6/325 dead transitions. [2025-04-14 00:28:57,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 325 transitions, 5692 flow [2025-04-14 00:28:57,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:28:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:28:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2025-04-14 00:28:57,357 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6042780748663101 [2025-04-14 00:28:57,357 INFO L175 Difference]: Start difference. First operand has 198 places, 284 transitions, 4263 flow. Second operand 11 states and 113 transitions. [2025-04-14 00:28:57,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 325 transitions, 5692 flow [2025-04-14 00:28:57,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 325 transitions, 5048 flow, removed 305 selfloop flow, removed 10 redundant places. [2025-04-14 00:28:57,569 INFO L231 Difference]: Finished difference. Result has 196 places, 284 transitions, 3833 flow [2025-04-14 00:28:57,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3641, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3833, PETRI_PLACES=196, PETRI_TRANSITIONS=284} [2025-04-14 00:28:57,570 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 177 predicate places. [2025-04-14 00:28:57,570 INFO L485 AbstractCegarLoop]: Abstraction has has 196 places, 284 transitions, 3833 flow [2025-04-14 00:28:57,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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:28:57,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:28:57,571 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:28:57,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 00:28:57,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 00:28:57,772 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:28:57,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:28:57,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1769315374, now seen corresponding path program 11 times [2025-04-14 00:28:57,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:28:57,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595840392] [2025-04-14 00:28:57,772 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:28:57,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:28:57,775 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 3 equivalence classes. [2025-04-14 00:28:57,779 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:28:57,779 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:28:57,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:28:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:28:57,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:28:57,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595840392] [2025-04-14 00:28:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595840392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:28:57,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158616339] [2025-04-14 00:28:57,951 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:28:57,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:28:57,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:28:57,954 INFO L229 MonitoredProcess]: Starting monitored process 14 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:28:57,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 00:28:57,980 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 3 equivalence classes. [2025-04-14 00:28:58,356 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:28:58,356 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:28:58,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:28:58,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:28:58,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:28:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:28:58,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:28:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:28:59,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158616339] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:28:59,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:28:59,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-04-14 00:28:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159271434] [2025-04-14 00:28:59,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:28:59,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 00:28:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:28:59,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 00:28:59,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-04-14 00:28:59,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:28:59,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 284 transitions, 3833 flow. Second operand has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 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:28:59,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:28:59,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:28:59,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:29:04,874 INFO L116 PetriNetUnfolderBase]: 1028/2047 cut-off events. [2025-04-14 00:29:04,874 INFO L117 PetriNetUnfolderBase]: For 101204/101204 co-relation queries the response was YES. [2025-04-14 00:29:04,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18584 conditions, 2047 events. 1028/2047 cut-off events. For 101204/101204 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 13768 event pairs, 108 based on Foata normal form. 15/2061 useless extension candidates. Maximal degree in co-relation 17639. Up to 1615 conditions per place. [2025-04-14 00:29:04,891 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 349 selfloop transitions, 88 changer transitions 5/444 dead transitions. [2025-04-14 00:29:04,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 444 transitions, 6259 flow [2025-04-14 00:29:04,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:29:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:29:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 231 transitions. [2025-04-14 00:29:04,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5435294117647059 [2025-04-14 00:29:04,892 INFO L175 Difference]: Start difference. First operand has 196 places, 284 transitions, 3833 flow. Second operand 25 states and 231 transitions. [2025-04-14 00:29:04,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 444 transitions, 6259 flow [2025-04-14 00:29:05,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 444 transitions, 6138 flow, removed 43 selfloop flow, removed 4 redundant places. [2025-04-14 00:29:05,075 INFO L231 Difference]: Finished difference. Result has 227 places, 354 transitions, 4884 flow [2025-04-14 00:29:05,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3764, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4884, PETRI_PLACES=227, PETRI_TRANSITIONS=354} [2025-04-14 00:29:05,075 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 208 predicate places. [2025-04-14 00:29:05,075 INFO L485 AbstractCegarLoop]: Abstraction has has 227 places, 354 transitions, 4884 flow [2025-04-14 00:29:05,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 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:29:05,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:29:05,076 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:29:05,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 00:29:05,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 00:29:05,276 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:29:05,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:29:05,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1539165845, now seen corresponding path program 12 times [2025-04-14 00:29:05,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:29:05,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586790117] [2025-04-14 00:29:05,277 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:29:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:29:05,279 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 3 equivalence classes. [2025-04-14 00:29:05,286 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:29:05,286 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:29:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:29:05,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586790117] [2025-04-14 00:29:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586790117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:29:05,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451123836] [2025-04-14 00:29:05,448 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:29:05,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:29:05,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:29:05,450 INFO L229 MonitoredProcess]: Starting monitored process 15 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:29:05,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 00:29:05,475 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 3 equivalence classes. [2025-04-14 00:29:06,077 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:29:06,078 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:29:06,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:06,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:29:06,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:29:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:17,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:29:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:25,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451123836] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:29:25,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:29:25,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-04-14 00:29:25,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725066782] [2025-04-14 00:29:25,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:29:25,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:29:25,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:29:25,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:29:25,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=356, Unknown=4, NotChecked=0, Total=420 [2025-04-14 00:29:25,688 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:29:25,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 354 transitions, 4884 flow. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 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:29:25,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:29:25,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:29:25,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:29:32,164 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:32,445 INFO L116 PetriNetUnfolderBase]: 1043/2078 cut-off events. [2025-04-14 00:29:32,445 INFO L117 PetriNetUnfolderBase]: For 102078/102078 co-relation queries the response was YES. [2025-04-14 00:29:32,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19450 conditions, 2078 events. 1043/2078 cut-off events. For 102078/102078 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 14151 event pairs, 26 based on Foata normal form. 6/2083 useless extension candidates. Maximal degree in co-relation 18759. Up to 1058 conditions per place. [2025-04-14 00:29:32,460 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 386 selfloop transitions, 69 changer transitions 24/481 dead transitions. [2025-04-14 00:29:32,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 481 transitions, 7283 flow [2025-04-14 00:29:32,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:29:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:29:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 205 transitions. [2025-04-14 00:29:32,462 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5024509803921569 [2025-04-14 00:29:32,462 INFO L175 Difference]: Start difference. First operand has 227 places, 354 transitions, 4884 flow. Second operand 24 states and 205 transitions. [2025-04-14 00:29:32,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 481 transitions, 7283 flow [2025-04-14 00:29:32,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 481 transitions, 6959 flow, removed 149 selfloop flow, removed 6 redundant places. [2025-04-14 00:29:32,749 INFO L231 Difference]: Finished difference. Result has 251 places, 366 transitions, 5070 flow [2025-04-14 00:29:32,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=4594, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5070, PETRI_PLACES=251, PETRI_TRANSITIONS=366} [2025-04-14 00:29:32,750 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 232 predicate places. [2025-04-14 00:29:32,750 INFO L485 AbstractCegarLoop]: Abstraction has has 251 places, 366 transitions, 5070 flow [2025-04-14 00:29:32,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 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:29:32,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:29:32,750 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:29:32,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-14 00:29:32,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:29:32,951 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:29:32,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:29:32,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1871373649, now seen corresponding path program 13 times [2025-04-14 00:29:32,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:29:32,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166430340] [2025-04-14 00:29:32,952 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:29:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:29:32,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:29:32,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:29:32,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:29:32,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:29:33,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166430340] [2025-04-14 00:29:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166430340] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:29:33,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154262487] [2025-04-14 00:29:33,059 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:29:33,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:29:33,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:29:33,061 INFO L229 MonitoredProcess]: Starting monitored process 16 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:29:33,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 00:29:33,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:29:33,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:29:33,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:29:33,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:33,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:29:33,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:29:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:34,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:29:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:35,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154262487] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:29:35,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:29:35,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2025-04-14 00:29:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491577607] [2025-04-14 00:29:35,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:29:35,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:29:35,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:29:35,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:29:35,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:29:35,205 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:29:35,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 366 transitions, 5070 flow. Second operand has 21 states, 21 states have (on average 6.0) internal successors, (126), 21 states have internal predecessors, (126), 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:29:35,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:29:35,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:29:35,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:29:38,370 INFO L116 PetriNetUnfolderBase]: 1088/2159 cut-off events. [2025-04-14 00:29:38,370 INFO L117 PetriNetUnfolderBase]: For 120254/120254 co-relation queries the response was YES. [2025-04-14 00:29:38,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20966 conditions, 2159 events. 1088/2159 cut-off events. For 120254/120254 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 14740 event pairs, 34 based on Foata normal form. 27/2185 useless extension candidates. Maximal degree in co-relation 20619. Up to 1046 conditions per place. [2025-04-14 00:29:38,386 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 361 selfloop transitions, 85 changer transitions 46/494 dead transitions. [2025-04-14 00:29:38,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 494 transitions, 8061 flow [2025-04-14 00:29:38,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:29:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:29:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 167 transitions. [2025-04-14 00:29:38,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.545751633986928 [2025-04-14 00:29:38,389 INFO L175 Difference]: Start difference. First operand has 251 places, 366 transitions, 5070 flow. Second operand 18 states and 167 transitions. [2025-04-14 00:29:38,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 494 transitions, 8061 flow [2025-04-14 00:29:38,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 494 transitions, 7940 flow, removed 51 selfloop flow, removed 7 redundant places. [2025-04-14 00:29:38,685 INFO L231 Difference]: Finished difference. Result has 260 places, 373 transitions, 5575 flow [2025-04-14 00:29:38,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=4911, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5575, PETRI_PLACES=260, PETRI_TRANSITIONS=373} [2025-04-14 00:29:38,686 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 241 predicate places. [2025-04-14 00:29:38,686 INFO L485 AbstractCegarLoop]: Abstraction has has 260 places, 373 transitions, 5575 flow [2025-04-14 00:29:38,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0) internal successors, (126), 21 states have internal predecessors, (126), 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:29:38,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:29:38,686 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:29:38,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-14 00:29:38,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 00:29:38,891 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:29:38,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:29:38,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1969479059, now seen corresponding path program 14 times [2025-04-14 00:29:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:29:38,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706229685] [2025-04-14 00:29:38,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:29:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:29:38,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 00:29:38,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:29:38,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:29:38,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:39,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:29:39,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706229685] [2025-04-14 00:29:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706229685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:29:39,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829210553] [2025-04-14 00:29:39,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:29:39,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:29:39,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:29:39,124 INFO L229 MonitoredProcess]: Starting monitored process 17 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:29:39,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 00:29:39,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 00:29:39,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:29:39,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:29:39,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:39,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:29:39,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:29:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:42,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:29:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829210553] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:29:42,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:29:42,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 19 [2025-04-14 00:29:42,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461984730] [2025-04-14 00:29:42,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:29:42,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:29:42,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:29:42,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:29:42,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:29:42,437 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:29:42,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 373 transitions, 5575 flow. Second operand has 20 states, 20 states have (on average 6.05) internal successors, (121), 20 states have internal predecessors, (121), 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:29:42,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:29:42,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:29:42,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:29:46,464 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:53,120 INFO L116 PetriNetUnfolderBase]: 1083/2117 cut-off events. [2025-04-14 00:29:53,120 INFO L117 PetriNetUnfolderBase]: For 129585/129585 co-relation queries the response was YES. [2025-04-14 00:29:53,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21303 conditions, 2117 events. 1083/2117 cut-off events. For 129585/129585 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 14018 event pairs, 128 based on Foata normal form. 16/2132 useless extension candidates. Maximal degree in co-relation 21154. Up to 1931 conditions per place. [2025-04-14 00:29:53,169 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 365 selfloop transitions, 71 changer transitions 0/438 dead transitions. [2025-04-14 00:29:53,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 438 transitions, 7134 flow [2025-04-14 00:29:53,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:29:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:29:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 157 transitions. [2025-04-14 00:29:53,170 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48606811145510836 [2025-04-14 00:29:53,170 INFO L175 Difference]: Start difference. First operand has 260 places, 373 transitions, 5575 flow. Second operand 19 states and 157 transitions. [2025-04-14 00:29:53,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 438 transitions, 7134 flow [2025-04-14 00:29:53,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 438 transitions, 6577 flow, removed 217 selfloop flow, removed 13 redundant places. [2025-04-14 00:29:53,489 INFO L231 Difference]: Finished difference. Result has 266 places, 399 transitions, 5796 flow [2025-04-14 00:29:53,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5077, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5796, PETRI_PLACES=266, PETRI_TRANSITIONS=399} [2025-04-14 00:29:53,489 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 247 predicate places. [2025-04-14 00:29:53,489 INFO L485 AbstractCegarLoop]: Abstraction has has 266 places, 399 transitions, 5796 flow [2025-04-14 00:29:53,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.05) internal successors, (121), 20 states have internal predecessors, (121), 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:29:53,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:29:53,489 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:29:53,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-14 00:29:53,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:29:53,690 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:29:53,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:29:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1391210790, now seen corresponding path program 15 times [2025-04-14 00:29:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:29:53,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410406450] [2025-04-14 00:29:53,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:29:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:29:53,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-04-14 00:29:53,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:29:53,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:29:53,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:29:53,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:29:53,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410406450] [2025-04-14 00:29:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410406450] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:29:53,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144254539] [2025-04-14 00:29:53,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:29:53,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:29:53,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:29:53,788 INFO L229 MonitoredProcess]: Starting monitored process 18 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:29:53,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 00:29:53,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-04-14 00:29:53,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:29:53,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:29:53,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:53,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:29:53,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:30:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:30:07,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:30:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:30:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144254539] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:30:09,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:30:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2025-04-14 00:30:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290927477] [2025-04-14 00:30:09,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:30:09,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:30:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:30:09,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:30:09,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=338, Unknown=1, NotChecked=0, Total=420 [2025-04-14 00:30:09,643 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:30:09,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 399 transitions, 5796 flow. Second operand has 21 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 21 states have internal predecessors, (125), 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:30:09,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:30:09,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:30:09,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:30:11,120 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:17,700 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:22,304 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:26,742 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:33,437 INFO L116 PetriNetUnfolderBase]: 1058/2066 cut-off events. [2025-04-14 00:30:33,437 INFO L117 PetriNetUnfolderBase]: For 120337/120337 co-relation queries the response was YES. [2025-04-14 00:30:33,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20357 conditions, 2066 events. 1058/2066 cut-off events. For 120337/120337 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 13628 event pairs, 58 based on Foata normal form. 17/2082 useless extension candidates. Maximal degree in co-relation 20158. Up to 929 conditions per place. [2025-04-14 00:30:33,452 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 347 selfloop transitions, 115 changer transitions 22/486 dead transitions. [2025-04-14 00:30:33,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 486 transitions, 8511 flow [2025-04-14 00:30:33,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:30:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:30:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 173 transitions. [2025-04-14 00:30:33,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5356037151702786 [2025-04-14 00:30:33,453 INFO L175 Difference]: Start difference. First operand has 266 places, 399 transitions, 5796 flow. Second operand 19 states and 173 transitions. [2025-04-14 00:30:33,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 486 transitions, 8511 flow [2025-04-14 00:30:33,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 486 transitions, 8270 flow, removed 110 selfloop flow, removed 7 redundant places. [2025-04-14 00:30:33,764 INFO L231 Difference]: Finished difference. Result has 277 places, 393 transitions, 5909 flow [2025-04-14 00:30:33,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5499, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5909, PETRI_PLACES=277, PETRI_TRANSITIONS=393} [2025-04-14 00:30:33,764 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 258 predicate places. [2025-04-14 00:30:33,765 INFO L485 AbstractCegarLoop]: Abstraction has has 277 places, 393 transitions, 5909 flow [2025-04-14 00:30:33,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 21 states have internal predecessors, (125), 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:30:33,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:30:33,765 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:30:33,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 00:30:33,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:30:33,965 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:30:33,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:30:33,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1502033310, now seen corresponding path program 16 times [2025-04-14 00:30:33,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:30:33,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328162788] [2025-04-14 00:30:33,966 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:30:33,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:30:33,968 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-14 00:30:33,971 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:30:33,971 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:30:33,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:30:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:30:34,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:30:34,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328162788] [2025-04-14 00:30:34,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328162788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:30:34,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490112261] [2025-04-14 00:30:34,081 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:30:34,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:30:34,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:30:34,083 INFO L229 MonitoredProcess]: Starting monitored process 19 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:30:34,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 00:30:34,107 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-14 00:30:34,238 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:30:34,239 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:30:34,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:30:34,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:30:34,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:31:07,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:31:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490112261] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:36,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:36,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2025-04-14 00:31:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123680866] [2025-04-14 00:31:36,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:36,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:31:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:36,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:31:36,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=344, Unknown=15, NotChecked=0, Total=420 [2025-04-14 00:31:36,093 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:31:36,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 393 transitions, 5909 flow. Second operand has 21 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 21 states have internal predecessors, (125), 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:31:36,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:36,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:31:36,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:40,661 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:31:44,664 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:10,932 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:12,600 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:23,278 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:27,316 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:29,911 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:37,427 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:38,874 INFO L116 PetriNetUnfolderBase]: 1084/2104 cut-off events. [2025-04-14 00:32:38,874 INFO L117 PetriNetUnfolderBase]: For 139783/139783 co-relation queries the response was YES. [2025-04-14 00:32:38,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21019 conditions, 2104 events. 1084/2104 cut-off events. For 139783/139783 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 13710 event pairs, 98 based on Foata normal form. 45/2148 useless extension candidates. Maximal degree in co-relation 20751. Up to 1558 conditions per place. [2025-04-14 00:32:38,890 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 330 selfloop transitions, 131 changer transitions 3/466 dead transitions. [2025-04-14 00:32:38,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 466 transitions, 7866 flow [2025-04-14 00:32:38,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:32:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:32:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 184 transitions. [2025-04-14 00:32:38,891 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2025-04-14 00:32:38,891 INFO L175 Difference]: Start difference. First operand has 277 places, 393 transitions, 5909 flow. Second operand 20 states and 184 transitions. [2025-04-14 00:32:38,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 466 transitions, 7866 flow [2025-04-14 00:32:39,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 466 transitions, 7550 flow, removed 111 selfloop flow, removed 12 redundant places. [2025-04-14 00:32:39,202 INFO L231 Difference]: Finished difference. Result has 283 places, 408 transitions, 6347 flow [2025-04-14 00:32:39,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5576, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6347, PETRI_PLACES=283, PETRI_TRANSITIONS=408} [2025-04-14 00:32:39,202 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 264 predicate places. [2025-04-14 00:32:39,203 INFO L485 AbstractCegarLoop]: Abstraction has has 283 places, 408 transitions, 6347 flow [2025-04-14 00:32:39,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 21 states have internal predecessors, (125), 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:32:39,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:32:39,203 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:32:39,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 00:32:39,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:39,403 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:32:39,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:32:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash -880527999, now seen corresponding path program 17 times [2025-04-14 00:32:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:32:39,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763783521] [2025-04-14 00:32:39,404 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:32:39,407 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 00:32:39,414 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:32:39,414 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:39,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:32:39,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:32:39,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763783521] [2025-04-14 00:32:39,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763783521] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:32:39,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558065296] [2025-04-14 00:32:39,594 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:32:39,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:32:39,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:32:39,596 INFO L229 MonitoredProcess]: Starting monitored process 20 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:32:39,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 00:32:39,618 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 00:32:39,993 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:32:39,993 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:32:39,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:32:39,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 00:32:39,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:32:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:32:48,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:32:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558065296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:55,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:55,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2025-04-14 00:32:55,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287918845] [2025-04-14 00:32:55,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:55,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:32:55,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:55,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:32:55,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:32:55,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 00:32:55,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 408 transitions, 6347 flow. Second operand has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:32:55,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:55,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 00:32:55,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:40,542 WARN L286 SmtUtils]: Spent 10.08s on a formula simplification. DAG size of input: 46 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:33:44,651 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:45,845 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:50,427 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:52,183 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:01,387 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-14 00:34:04,717 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:34:04,718 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:34:05,640 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:05,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 00:34:05,918 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 00:34:05,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-14 00:34:05,931 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:34:05,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 00:34:05,934 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 00:34:05,936 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:34:05,936 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:34:05,936 INFO L422 BasicCegarLoop]: Path program histogram: [17, 2, 2, 1] [2025-04-14 00:34:05,950 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:34:05,950 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:34:05,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:34:05 BasicIcfg [2025-04-14 00:34:05,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:34:05,958 INFO L158 Benchmark]: Toolchain (without parser) took 879626.90ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 100.9MB in the beginning and 253.3MB in the end (delta: -152.5MB). Peak memory consumption was 271.0MB. Max. memory is 8.0GB. [2025-04-14 00:34:05,958 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:34:05,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.64ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 86.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:34:05,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.82ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:34:05,958 INFO L158 Benchmark]: Boogie Preprocessor took 38.50ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:34:05,958 INFO L158 Benchmark]: IcfgBuilder took 308.31ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 61.7MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 00:34:05,959 INFO L158 Benchmark]: TraceAbstraction took 879013.06ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 61.1MB in the beginning and 253.3MB in the end (delta: -192.2MB). Peak memory consumption was 233.3MB. Max. memory is 8.0GB. [2025-04-14 00:34:05,959 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.34ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.64ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 86.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.82ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.50ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 308.31ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 61.7MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 879013.06ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 61.1MB in the beginning and 253.3MB in the end (delta: -192.2MB). Peak memory consumption was 233.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - 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: 878.9s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 524.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 41 mSolverCounterUnknown, 1340 SdHoareTripleChecker+Valid, 305.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1340 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 304.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8335 IncrementalHoareTripleChecker+Invalid, 8635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 0 mSDtfsCounter, 8335 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 821 GetRequests, 379 SyntacticMatches, 20 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 501.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6347occurred in iteration=21, InterpolantAutomatonStates: 312, 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, 3.6s SatisfiabilityAnalysisTime, 346.7s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 863 ConstructedInterpolants, 0 QuantifiedInterpolants, 14831 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1683 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 60 InterpolantComputations, 3 PerfectInterpolantSequences, 32/308 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown