/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-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:26:34,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:26:34,406 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:26:34,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:26:34,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:26:34,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:26:34,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:26:34,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:26:34,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:26:34,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:26:34,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:26:34,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:26:34,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:26:34,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:26:34,435 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:26:34,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:26:34,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:26:34,435 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:26:34,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:26:34,436 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:26:34,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:26:34,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:26:34,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:26:34,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:26:34,438 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:26:34,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:26:34,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:26:34,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:26:34,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:26:34,648 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:26:34,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2025-04-14 00:26:35,909 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acad37a3a/d62351cac52a4976b9e1d74a7cf98efa/FLAG283904f3c [2025-04-14 00:26:36,134 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:26:36,135 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2025-04-14 00:26:36,142 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acad37a3a/d62351cac52a4976b9e1d74a7cf98efa/FLAG283904f3c [2025-04-14 00:26:36,910 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acad37a3a/d62351cac52a4976b9e1d74a7cf98efa [2025-04-14 00:26:36,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:26:36,913 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:26:36,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:26:36,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:26:36,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:26:36,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:26:36" (1/1) ... [2025-04-14 00:26:36,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0958a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:36, skipping insertion in model container [2025-04-14 00:26:36,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:26:36" (1/1) ... [2025-04-14 00:26:36,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:26:37,098 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-exp3x3.wvr.c[2703,2716] [2025-04-14 00:26:37,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:26:37,115 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:26:37,148 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-exp3x3.wvr.c[2703,2716] [2025-04-14 00:26:37,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:26:37,164 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:26:37,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37 WrapperNode [2025-04-14 00:26:37,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:26:37,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:26:37,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:26:37,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:26:37,171 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:26:37" (1/1) ... [2025-04-14 00:26:37,177 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:26:37" (1/1) ... [2025-04-14 00:26:37,194 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2025-04-14 00:26:37,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:26:37,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:26:37,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:26:37,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:26:37,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,222 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:26:37,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:26:37,232 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:26:37,232 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:26:37,232 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:26:37,233 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (1/1) ... [2025-04-14 00:26:37,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:26:37,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:26:37,260 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:26:37,262 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:26:37,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:26:37,276 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:26:37,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:26:37,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:26:37,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:26:37,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:26:37,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:26:37,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 00:26:37,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 00:26:37,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:26:37,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-14 00:26:37,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-14 00:26:37,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-14 00:26:37,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-14 00:26:37,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:26:37,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:26:37,278 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:26:37,349 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:26:37,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:26:37,509 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:26:37,510 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:26:37,510 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:26:37,683 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:26:37,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:26:37 BoogieIcfgContainer [2025-04-14 00:26:37,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:26:37,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:26:37,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:26:37,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:26:37,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:26:36" (1/3) ... [2025-04-14 00:26:37,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1648c753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:26:37, skipping insertion in model container [2025-04-14 00:26:37,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:37" (2/3) ... [2025-04-14 00:26:37,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1648c753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:26:37, skipping insertion in model container [2025-04-14 00:26:37,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:26:37" (3/3) ... [2025-04-14 00:26:37,690 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2025-04-14 00:26:37,700 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:26:37,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3.wvr.c that has 7 procedures, 40 locations, 39 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 00:26:37,701 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:26:37,756 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-14 00:26:37,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 132 flow [2025-04-14 00:26:37,831 INFO L116 PetriNetUnfolderBase]: 6/39 cut-off events. [2025-04-14 00:26:37,836 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:26:37,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 39 events. 6/39 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-14 00:26:37,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 45 transitions, 132 flow [2025-04-14 00:26:37,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 112 flow [2025-04-14 00:26:37,851 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:26:37,860 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;@7d22f807, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:26:37,860 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-14 00:26:37,879 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:26:37,879 INFO L116 PetriNetUnfolderBase]: 6/37 cut-off events. [2025-04-14 00:26:37,879 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:26:37,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:37,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:37,882 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:37,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash -774902356, now seen corresponding path program 1 times [2025-04-14 00:26:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:37,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965750848] [2025-04-14 00:26:37,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:37,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 00:26:37,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:26:37,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:37,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:38,375 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:26:38,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:38,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965750848] [2025-04-14 00:26:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965750848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:26:38,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:26:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:26:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044552897] [2025-04-14 00:26:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:38,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:26:38,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:38,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:26:38,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:26:38,403 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:38,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:38,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:38,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:38,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:39,664 INFO L116 PetriNetUnfolderBase]: 18895/21811 cut-off events. [2025-04-14 00:26:39,664 INFO L117 PetriNetUnfolderBase]: For 1387/1387 co-relation queries the response was YES. [2025-04-14 00:26:39,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44836 conditions, 21811 events. 18895/21811 cut-off events. For 1387/1387 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 69575 event pairs, 1570 based on Foata normal form. 1/11937 useless extension candidates. Maximal degree in co-relation 38647. Up to 20725 conditions per place. [2025-04-14 00:26:39,803 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 53 selfloop transitions, 7 changer transitions 1/67 dead transitions. [2025-04-14 00:26:39,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 325 flow [2025-04-14 00:26:39,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:26:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:26:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-04-14 00:26:39,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.725925925925926 [2025-04-14 00:26:39,815 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 112 flow. Second operand 3 states and 98 transitions. [2025-04-14 00:26:39,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 325 flow [2025-04-14 00:26:39,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 279 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-14 00:26:39,841 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 135 flow [2025-04-14 00:26:39,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2025-04-14 00:26:39,846 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2025-04-14 00:26:39,846 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 135 flow [2025-04-14 00:26:39,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:39,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:39,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:39,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:26:39,847 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:39,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash 478830566, now seen corresponding path program 1 times [2025-04-14 00:26:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:39,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427889287] [2025-04-14 00:26:39,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:39,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:26:39,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:39,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:39,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:40,012 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:26:40,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:40,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427889287] [2025-04-14 00:26:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427889287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:26:40,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:26:40,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:26:40,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802658793] [2025-04-14 00:26:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:40,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:26:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:40,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:26:40,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:26:40,014 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:40,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:40,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:40,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:40,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:41,328 INFO L116 PetriNetUnfolderBase]: 23909/27756 cut-off events. [2025-04-14 00:26:41,328 INFO L117 PetriNetUnfolderBase]: For 6608/6608 co-relation queries the response was YES. [2025-04-14 00:26:41,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69037 conditions, 27756 events. 23909/27756 cut-off events. For 6608/6608 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 96269 event pairs, 1755 based on Foata normal form. 294/27976 useless extension candidates. Maximal degree in co-relation 18915. Up to 12326 conditions per place. [2025-04-14 00:26:41,467 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 106 selfloop transitions, 10 changer transitions 0/122 dead transitions. [2025-04-14 00:26:41,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 122 transitions, 593 flow [2025-04-14 00:26:41,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:26:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:26:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-04-14 00:26:41,471 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7377777777777778 [2025-04-14 00:26:41,471 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 135 flow. Second operand 5 states and 166 transitions. [2025-04-14 00:26:41,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 122 transitions, 593 flow [2025-04-14 00:26:41,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 122 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:26:41,474 INFO L231 Difference]: Finished difference. Result has 47 places, 51 transitions, 193 flow [2025-04-14 00:26:41,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=47, PETRI_TRANSITIONS=51} [2025-04-14 00:26:41,476 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2025-04-14 00:26:41,476 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 51 transitions, 193 flow [2025-04-14 00:26:41,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:41,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:41,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:41,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:26:41,478 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:41,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1147557610, now seen corresponding path program 2 times [2025-04-14 00:26:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:41,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384844886] [2025-04-14 00:26:41,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:26:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:41,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:26:41,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:41,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:26:41,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:41,692 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:26:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:41,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384844886] [2025-04-14 00:26:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384844886] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:26:41,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265198339] [2025-04-14 00:26:41,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:26:41,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:41,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:26:41,695 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:26:41,697 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:26:41,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:26:41,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:41,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:26:41,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:41,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:26:41,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:26:41,986 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:26:41,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:26:42,076 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:26:42,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265198339] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:26:42,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:26:42,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:26:42,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389636] [2025-04-14 00:26:42,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:26:42,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:26:42,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:42,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:26:42,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:26:42,078 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:42,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 51 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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:42,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:42,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:42,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:43,257 INFO L116 PetriNetUnfolderBase]: 22870/26763 cut-off events. [2025-04-14 00:26:43,258 INFO L117 PetriNetUnfolderBase]: For 17344/17344 co-relation queries the response was YES. [2025-04-14 00:26:43,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76696 conditions, 26763 events. 22870/26763 cut-off events. For 17344/17344 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 96693 event pairs, 4498 based on Foata normal form. 565/27032 useless extension candidates. Maximal degree in co-relation 23010. Up to 14246 conditions per place. [2025-04-14 00:26:43,415 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 103 selfloop transitions, 10 changer transitions 0/119 dead transitions. [2025-04-14 00:26:43,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 119 transitions, 624 flow [2025-04-14 00:26:43,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:26:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:26:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-04-14 00:26:43,416 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-04-14 00:26:43,417 INFO L175 Difference]: Start difference. First operand has 47 places, 51 transitions, 193 flow. Second operand 5 states and 165 transitions. [2025-04-14 00:26:43,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 119 transitions, 624 flow [2025-04-14 00:26:43,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 119 transitions, 624 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:26:43,422 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 247 flow [2025-04-14 00:26:43,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2025-04-14 00:26:43,422 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-04-14 00:26:43,422 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 247 flow [2025-04-14 00:26:43,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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:43,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:43,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:43,429 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:26:43,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:43,627 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:43,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:43,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1066107163, now seen corresponding path program 1 times [2025-04-14 00:26:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:43,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697724612] [2025-04-14 00:26:43,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:43,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:26:43,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:43,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:43,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:43,740 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:26:43,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:43,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697724612] [2025-04-14 00:26:43,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697724612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:26:43,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:26:43,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:26:43,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486339858] [2025-04-14 00:26:43,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:43,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:26:43,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:43,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:26:43,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:26:43,741 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:43,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:43,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:43,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:43,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:44,939 INFO L116 PetriNetUnfolderBase]: 22954/26801 cut-off events. [2025-04-14 00:26:44,939 INFO L117 PetriNetUnfolderBase]: For 32412/32412 co-relation queries the response was YES. [2025-04-14 00:26:44,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82383 conditions, 26801 events. 22954/26801 cut-off events. For 32412/32412 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 96535 event pairs, 1824 based on Foata normal form. 390/27117 useless extension candidates. Maximal degree in co-relation 44551. Up to 11936 conditions per place. [2025-04-14 00:26:45,228 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 108 selfloop transitions, 8 changer transitions 0/122 dead transitions. [2025-04-14 00:26:45,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 122 transitions, 672 flow [2025-04-14 00:26:45,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:26:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:26:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-04-14 00:26:45,229 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7288888888888889 [2025-04-14 00:26:45,229 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 247 flow. Second operand 5 states and 164 transitions. [2025-04-14 00:26:45,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 122 transitions, 672 flow [2025-04-14 00:26:45,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 122 transitions, 663 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 00:26:45,279 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 252 flow [2025-04-14 00:26:45,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-04-14 00:26:45,279 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2025-04-14 00:26:45,279 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 252 flow [2025-04-14 00:26:45,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:45,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:45,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:45,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:26:45,280 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:45,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1480160418, now seen corresponding path program 1 times [2025-04-14 00:26:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:45,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867305144] [2025-04-14 00:26:45,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:45,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:26:45,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:45,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:45,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:45,353 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:26:45,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:45,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867305144] [2025-04-14 00:26:45,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867305144] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:26:45,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085573053] [2025-04-14 00:26:45,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:45,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:45,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:26:45,357 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:26:45,358 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:26:45,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:26:45,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:45,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:45,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:45,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:26:45,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:26:45,502 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:26:45,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:26:45,545 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:26:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085573053] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:26:45,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:26:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:26:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775964076] [2025-04-14 00:26:45,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:26:45,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:26:45,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:45,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:26:45,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:26:45,546 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:45,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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:45,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:45,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:45,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:47,006 INFO L116 PetriNetUnfolderBase]: 30775/36606 cut-off events. [2025-04-14 00:26:47,006 INFO L117 PetriNetUnfolderBase]: For 64891/64895 co-relation queries the response was YES. [2025-04-14 00:26:47,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118230 conditions, 36606 events. 30775/36606 cut-off events. For 64891/64895 co-relation queries the response was YES. Maximal size of possible extension queue 1303. Compared 147082 event pairs, 4758 based on Foata normal form. 769/37019 useless extension candidates. Maximal degree in co-relation 63423. Up to 17670 conditions per place. [2025-04-14 00:26:47,214 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 133 selfloop transitions, 8 changer transitions 0/147 dead transitions. [2025-04-14 00:26:47,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 147 transitions, 1034 flow [2025-04-14 00:26:47,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:26:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:26:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-04-14 00:26:47,215 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7155555555555555 [2025-04-14 00:26:47,215 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 252 flow. Second operand 5 states and 161 transitions. [2025-04-14 00:26:47,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 147 transitions, 1034 flow [2025-04-14 00:26:47,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 147 transitions, 1007 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 00:26:47,228 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 298 flow [2025-04-14 00:26:47,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-04-14 00:26:47,228 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2025-04-14 00:26:47,228 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 298 flow [2025-04-14 00:26:47,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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:47,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:47,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:47,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:26:47,429 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:26:47,429 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:47,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1999922434, now seen corresponding path program 2 times [2025-04-14 00:26:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:47,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355401039] [2025-04-14 00:26:47,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:26:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:47,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:26:47,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:47,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:26:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:47,510 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:26:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:47,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355401039] [2025-04-14 00:26:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355401039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:26:47,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:26:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:26:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396083311] [2025-04-14 00:26:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:47,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:26:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:47,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:26:47,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:26:47,511 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:47,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:47,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:47,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:47,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:48,992 INFO L116 PetriNetUnfolderBase]: 27253/32240 cut-off events. [2025-04-14 00:26:48,993 INFO L117 PetriNetUnfolderBase]: For 63964/63968 co-relation queries the response was YES. [2025-04-14 00:26:49,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117730 conditions, 32240 events. 27253/32240 cut-off events. For 63964/63968 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 123146 event pairs, 1769 based on Foata normal form. 417/32565 useless extension candidates. Maximal degree in co-relation 75730. Up to 14439 conditions per place. [2025-04-14 00:26:49,210 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 136 selfloop transitions, 11 changer transitions 0/153 dead transitions. [2025-04-14 00:26:49,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 153 transitions, 1112 flow [2025-04-14 00:26:49,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:26:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:26:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2025-04-14 00:26:49,212 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7022222222222222 [2025-04-14 00:26:49,212 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 298 flow. Second operand 5 states and 158 transitions. [2025-04-14 00:26:49,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 153 transitions, 1112 flow [2025-04-14 00:26:49,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 153 transitions, 1112 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:26:49,338 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 359 flow [2025-04-14 00:26:49,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-04-14 00:26:49,339 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2025-04-14 00:26:49,339 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 359 flow [2025-04-14 00:26:49,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:49,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:49,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:49,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:26:49,340 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:49,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:49,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1154745794, now seen corresponding path program 1 times [2025-04-14 00:26:49,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:49,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142355421] [2025-04-14 00:26:49,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:49,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:49,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:26:49,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:49,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:49,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:49,527 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:26:49,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:49,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142355421] [2025-04-14 00:26:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142355421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:26:49,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268861263] [2025-04-14 00:26:49,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:49,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:49,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:26:49,530 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:26:49,532 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:26:49,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:26:49,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:49,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:49,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:49,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:26:49,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:26:49,707 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:26:49,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:26:49,758 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:26:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268861263] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:26:49,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:26:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:26:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875461244] [2025-04-14 00:26:49,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:26:49,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:26:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:49,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:26:49,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:26:49,759 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:49,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:49,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:49,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:49,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:51,836 INFO L116 PetriNetUnfolderBase]: 35915/43379 cut-off events. [2025-04-14 00:26:51,837 INFO L117 PetriNetUnfolderBase]: For 126299/126351 co-relation queries the response was YES. [2025-04-14 00:26:51,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172207 conditions, 43379 events. 35915/43379 cut-off events. For 126299/126351 co-relation queries the response was YES. Maximal size of possible extension queue 1670. Compared 190224 event pairs, 5647 based on Foata normal form. 789/43300 useless extension candidates. Maximal degree in co-relation 109014. Up to 19656 conditions per place. [2025-04-14 00:26:52,146 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 160 selfloop transitions, 8 changer transitions 0/174 dead transitions. [2025-04-14 00:26:52,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 174 transitions, 1417 flow [2025-04-14 00:26:52,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:26:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:26:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2025-04-14 00:26:52,148 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6711111111111111 [2025-04-14 00:26:52,148 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 359 flow. Second operand 5 states and 151 transitions. [2025-04-14 00:26:52,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 174 transitions, 1417 flow [2025-04-14 00:26:52,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 174 transitions, 1377 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-04-14 00:26:52,199 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 401 flow [2025-04-14 00:26:52,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2025-04-14 00:26:52,200 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2025-04-14 00:26:52,200 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 401 flow [2025-04-14 00:26:52,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:52,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:52,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:52,206 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:26:52,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:52,401 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:52,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash 330606045, now seen corresponding path program 1 times [2025-04-14 00:26:52,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:52,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360935987] [2025-04-14 00:26:52,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:52,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:26:52,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:52,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:52,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:52,481 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:26:52,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:52,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360935987] [2025-04-14 00:26:52,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360935987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:26:52,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:26:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:26:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369800222] [2025-04-14 00:26:52,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:52,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:26:52,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:52,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:26:52,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:26:52,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:52,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 401 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:52,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:52,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:52,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:54,693 INFO L116 PetriNetUnfolderBase]: 35333/42425 cut-off events. [2025-04-14 00:26:54,693 INFO L117 PetriNetUnfolderBase]: For 127543/127547 co-relation queries the response was YES. [2025-04-14 00:26:54,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184251 conditions, 42425 events. 35333/42425 cut-off events. For 127543/127547 co-relation queries the response was YES. Maximal size of possible extension queue 1628. Compared 182499 event pairs, 1929 based on Foata normal form. 583/42920 useless extension candidates. Maximal degree in co-relation 116723. Up to 19233 conditions per place. [2025-04-14 00:26:54,984 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 156 selfloop transitions, 8 changer transitions 0/170 dead transitions. [2025-04-14 00:26:54,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 170 transitions, 1347 flow [2025-04-14 00:26:54,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:26:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:26:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-04-14 00:26:54,985 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-04-14 00:26:54,985 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 401 flow. Second operand 5 states and 156 transitions. [2025-04-14 00:26:54,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 170 transitions, 1347 flow [2025-04-14 00:26:55,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 170 transitions, 1347 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:26:55,229 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 417 flow [2025-04-14 00:26:55,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=417, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2025-04-14 00:26:55,230 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2025-04-14 00:26:55,230 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 417 flow [2025-04-14 00:26:55,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:55,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:55,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:55,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:26:55,230 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:55,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1332745877, now seen corresponding path program 1 times [2025-04-14 00:26:55,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:55,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002607671] [2025-04-14 00:26:55,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:55,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:55,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:26:55,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:55,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:55,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:55,293 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:26:55,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:55,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002607671] [2025-04-14 00:26:55,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002607671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:26:55,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:26:55,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:26:55,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500711643] [2025-04-14 00:26:55,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:55,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:26:55,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:55,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:26:55,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:26:55,294 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:55,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 417 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:55,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:55,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:55,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:57,703 INFO L116 PetriNetUnfolderBase]: 34943/42251 cut-off events. [2025-04-14 00:26:57,703 INFO L117 PetriNetUnfolderBase]: For 150972/151024 co-relation queries the response was YES. [2025-04-14 00:26:57,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188746 conditions, 42251 events. 34943/42251 cut-off events. For 150972/151024 co-relation queries the response was YES. Maximal size of possible extension queue 1641. Compared 182010 event pairs, 1847 based on Foata normal form. 403/42122 useless extension candidates. Maximal degree in co-relation 119658. Up to 18684 conditions per place. [2025-04-14 00:26:57,999 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 165 selfloop transitions, 10 changer transitions 0/181 dead transitions. [2025-04-14 00:26:57,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 181 transitions, 1572 flow [2025-04-14 00:26:57,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:26:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:26:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2025-04-14 00:26:58,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2025-04-14 00:26:58,000 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 417 flow. Second operand 5 states and 149 transitions. [2025-04-14 00:26:58,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 181 transitions, 1572 flow [2025-04-14 00:26:58,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 181 transitions, 1535 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 00:26:58,273 INFO L231 Difference]: Finished difference. Result has 83 places, 72 transitions, 469 flow [2025-04-14 00:26:58,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=83, PETRI_TRANSITIONS=72} [2025-04-14 00:26:58,274 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2025-04-14 00:26:58,274 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 72 transitions, 469 flow [2025-04-14 00:26:58,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:58,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:58,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:58,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:26:58,274 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:26:58,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1063214810, now seen corresponding path program 2 times [2025-04-14 00:26:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:58,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802005580] [2025-04-14 00:26:58,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:26:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:58,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:26:58,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:26:58,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:26:58,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:58,357 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:26:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:58,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802005580] [2025-04-14 00:26:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802005580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:26:58,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:26:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:26:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942067135] [2025-04-14 00:26:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:58,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:26:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:58,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:26:58,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:26:58,358 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:26:58,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 469 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:58,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:58,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:26:58,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:27:00,469 INFO L116 PetriNetUnfolderBase]: 31321/37845 cut-off events. [2025-04-14 00:27:00,469 INFO L117 PetriNetUnfolderBase]: For 131029/131081 co-relation queries the response was YES. [2025-04-14 00:27:00,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174168 conditions, 37845 events. 31321/37845 cut-off events. For 131029/131081 co-relation queries the response was YES. Maximal size of possible extension queue 1446. Compared 159102 event pairs, 2186 based on Foata normal form. 399/37712 useless extension candidates. Maximal degree in co-relation 113491. Up to 16532 conditions per place. [2025-04-14 00:27:00,773 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 164 selfloop transitions, 9 changer transitions 0/179 dead transitions. [2025-04-14 00:27:00,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 179 transitions, 1544 flow [2025-04-14 00:27:00,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:27:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:27:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2025-04-14 00:27:00,774 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2025-04-14 00:27:00,774 INFO L175 Difference]: Start difference. First operand has 83 places, 72 transitions, 469 flow. Second operand 5 states and 149 transitions. [2025-04-14 00:27:00,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 179 transitions, 1544 flow [2025-04-14 00:27:01,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 179 transitions, 1531 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 00:27:01,313 INFO L231 Difference]: Finished difference. Result has 87 places, 71 transitions, 469 flow [2025-04-14 00:27:01,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2025-04-14 00:27:01,314 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2025-04-14 00:27:01,314 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 469 flow [2025-04-14 00:27:01,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:27:01,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:27:01,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:27:01,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:27:01,314 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:27:01,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:27:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash 179405213, now seen corresponding path program 2 times [2025-04-14 00:27:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:27:01,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230037027] [2025-04-14 00:27:01,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:27:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:27:01,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:27:01,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:27:01,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:27:01,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:01,380 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:27:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:27:01,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230037027] [2025-04-14 00:27:01,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230037027] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:27:01,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540000516] [2025-04-14 00:27:01,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:27:01,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:01,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:27:01,383 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:27:01,384 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:27:01,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:27:01,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:27:01,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:27:01,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:01,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:27:01,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:27:01,598 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:27:01,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:27:01,674 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:27:01,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540000516] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:27:01,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:27:01,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:27:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114791455] [2025-04-14 00:27:01,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:27:01,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:27:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:27:01,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:27:01,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:27:01,676 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:27:01,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 71 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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:27:01,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:27:01,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:27:01,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:27:03,727 INFO L116 PetriNetUnfolderBase]: 30549/37217 cut-off events. [2025-04-14 00:27:03,727 INFO L117 PetriNetUnfolderBase]: For 132711/132763 co-relation queries the response was YES. [2025-04-14 00:27:03,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174788 conditions, 37217 events. 30549/37217 cut-off events. For 132711/132763 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 164988 event pairs, 5457 based on Foata normal form. 785/37326 useless extension candidates. Maximal degree in co-relation 113906. Up to 19275 conditions per place. [2025-04-14 00:27:04,167 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 159 selfloop transitions, 8 changer transitions 0/173 dead transitions. [2025-04-14 00:27:04,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 173 transitions, 1504 flow [2025-04-14 00:27:04,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:27:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:27:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-04-14 00:27:04,168 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2025-04-14 00:27:04,168 INFO L175 Difference]: Start difference. First operand has 87 places, 71 transitions, 469 flow. Second operand 5 states and 146 transitions. [2025-04-14 00:27:04,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 173 transitions, 1504 flow [2025-04-14 00:27:04,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 173 transitions, 1495 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:27:04,316 INFO L231 Difference]: Finished difference. Result has 92 places, 74 transitions, 510 flow [2025-04-14 00:27:04,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=92, PETRI_TRANSITIONS=74} [2025-04-14 00:27:04,316 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2025-04-14 00:27:04,316 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 74 transitions, 510 flow [2025-04-14 00:27:04,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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:27:04,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:27:04,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:27:04,322 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:27:04,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:04,517 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:27:04,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:27:04,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1776789663, now seen corresponding path program 2 times [2025-04-14 00:27:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:27:04,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423196575] [2025-04-14 00:27:04,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:27:04,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:27:04,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:27:04,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:27:04,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:27:04,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:04,569 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:27:04,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:27:04,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423196575] [2025-04-14 00:27:04,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423196575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:27:04,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60151503] [2025-04-14 00:27:04,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:27:04,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:04,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:27:04,571 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:27:04,573 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:27:04,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:27:04,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:27:04,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:27:04,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:04,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:27:04,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:27:04,740 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:27:04,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:27:04,786 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:27:04,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60151503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:27:04,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:27:04,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:27:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504334020] [2025-04-14 00:27:04,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:27:04,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:27:04,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:27:04,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:27:04,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:27:04,787 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:27:04,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 74 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:27:04,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:27:04,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:27:04,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:27:06,836 INFO L116 PetriNetUnfolderBase]: 29565/36029 cut-off events. [2025-04-14 00:27:06,836 INFO L117 PetriNetUnfolderBase]: For 134061/134065 co-relation queries the response was YES. [2025-04-14 00:27:06,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177021 conditions, 36029 events. 29565/36029 cut-off events. For 134061/134065 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 159897 event pairs, 5915 based on Foata normal form. 985/36722 useless extension candidates. Maximal degree in co-relation 159328. Up to 19907 conditions per place. [2025-04-14 00:27:07,157 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 179 selfloop transitions, 8 changer transitions 0/193 dead transitions. [2025-04-14 00:27:07,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 193 transitions, 1736 flow [2025-04-14 00:27:07,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:27:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:27:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-04-14 00:27:07,158 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6844444444444444 [2025-04-14 00:27:07,158 INFO L175 Difference]: Start difference. First operand has 92 places, 74 transitions, 510 flow. Second operand 5 states and 154 transitions. [2025-04-14 00:27:07,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 193 transitions, 1736 flow [2025-04-14 00:27:07,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 193 transitions, 1674 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-04-14 00:27:07,544 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 541 flow [2025-04-14 00:27:07,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=541, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2025-04-14 00:27:07,545 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 45 predicate places. [2025-04-14 00:27:07,545 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 541 flow [2025-04-14 00:27:07,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:27:07,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:27:07,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:27:07,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 00:27:07,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 00:27:07,749 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:27:07,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:27:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash 791327473, now seen corresponding path program 2 times [2025-04-14 00:27:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:27:07,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163789340] [2025-04-14 00:27:07,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:27:07,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:27:07,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:27:07,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:27:07,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:27:07,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:07,819 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:27:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:27:07,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163789340] [2025-04-14 00:27:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163789340] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:27:07,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450465990] [2025-04-14 00:27:07,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:27:07,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:27:07,821 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:27:07,822 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:27:07,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:27:07,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:27:07,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:27:07,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:07,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:27:07,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:27:07,970 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:27:07,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:27:08,010 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:27:08,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450465990] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:27:08,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:27:08,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:27:08,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113798008] [2025-04-14 00:27:08,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:27:08,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:27:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:27:08,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:27:08,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:27:08,011 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:27:08,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 541 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:27:08,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:27:08,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:27:08,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:27:10,094 INFO L116 PetriNetUnfolderBase]: 28729/35136 cut-off events. [2025-04-14 00:27:10,094 INFO L117 PetriNetUnfolderBase]: For 146612/146628 co-relation queries the response was YES. [2025-04-14 00:27:10,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178008 conditions, 35136 events. 28729/35136 cut-off events. For 146612/146628 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 158842 event pairs, 8432 based on Foata normal form. 840/35712 useless extension candidates. Maximal degree in co-relation 161134. Up to 19637 conditions per place. [2025-04-14 00:27:10,386 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 199 selfloop transitions, 8 changer transitions 0/213 dead transitions. [2025-04-14 00:27:10,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 213 transitions, 1895 flow [2025-04-14 00:27:10,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:27:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:27:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-04-14 00:27:10,387 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.72 [2025-04-14 00:27:10,387 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 541 flow. Second operand 5 states and 162 transitions. [2025-04-14 00:27:10,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 213 transitions, 1895 flow [2025-04-14 00:27:10,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 213 transitions, 1833 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-04-14 00:27:10,798 INFO L231 Difference]: Finished difference. Result has 100 places, 80 transitions, 578 flow [2025-04-14 00:27:10,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=578, PETRI_PLACES=100, PETRI_TRANSITIONS=80} [2025-04-14 00:27:10,800 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2025-04-14 00:27:10,800 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 80 transitions, 578 flow [2025-04-14 00:27:10,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:27:10,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:27:10,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:27:10,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 00:27:11,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:11,004 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:27:11,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:27:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash -463444295, now seen corresponding path program 1 times [2025-04-14 00:27:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:27:11,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879327756] [2025-04-14 00:27:11,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:27:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:27:11,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:27:11,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:27:11,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:27:11,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:11,655 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:27:11,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:27:11,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879327756] [2025-04-14 00:27:11,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879327756] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:27:11,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999884755] [2025-04-14 00:27:11,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:27:11,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:27:11,659 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:27:11,675 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:27:11,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:27:11,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:27:11,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:27:11,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:11,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:27:11,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:27:14,034 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:27:14,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:27:14,727 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:27:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999884755] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:27:14,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:27:14,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-14 00:27:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437162506] [2025-04-14 00:27:14,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:27:14,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:27:14,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:27:14,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:27:14,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:27:14,728 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:27:14,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 80 transitions, 578 flow. Second operand has 16 states, 16 states have (on average 16.75) internal successors, (268), 16 states have internal predecessors, (268), 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:27:14,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:27:14,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:27:14,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:27:21,380 INFO L116 PetriNetUnfolderBase]: 42114/51705 cut-off events. [2025-04-14 00:27:21,380 INFO L117 PetriNetUnfolderBase]: For 205846/205846 co-relation queries the response was YES. [2025-04-14 00:27:21,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264331 conditions, 51705 events. 42114/51705 cut-off events. For 205846/205846 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 245713 event pairs, 5347 based on Foata normal form. 75/51700 useless extension candidates. Maximal degree in co-relation 244143. Up to 38265 conditions per place. [2025-04-14 00:27:21,881 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 373 selfloop transitions, 176 changer transitions 7/562 dead transitions. [2025-04-14 00:27:21,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 562 transitions, 4859 flow [2025-04-14 00:27:21,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:27:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:27:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 536 transitions. [2025-04-14 00:27:21,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2025-04-14 00:27:21,883 INFO L175 Difference]: Start difference. First operand has 100 places, 80 transitions, 578 flow. Second operand 16 states and 536 transitions. [2025-04-14 00:27:21,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 562 transitions, 4859 flow [2025-04-14 00:27:22,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 562 transitions, 4764 flow, removed 32 selfloop flow, removed 1 redundant places. [2025-04-14 00:27:22,597 INFO L231 Difference]: Finished difference. Result has 124 places, 252 transitions, 2701 flow [2025-04-14 00:27:22,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2701, PETRI_PLACES=124, PETRI_TRANSITIONS=252} [2025-04-14 00:27:22,597 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 73 predicate places. [2025-04-14 00:27:22,597 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 252 transitions, 2701 flow [2025-04-14 00:27:22,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.75) internal successors, (268), 16 states have internal predecessors, (268), 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:27:22,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:27:22,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:27:22,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 00:27:22,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:22,798 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:27:22,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:27:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash -391899347, now seen corresponding path program 1 times [2025-04-14 00:27:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:27:22,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645754611] [2025-04-14 00:27:22,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:27:22,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:27:22,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:27:22,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:27:22,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:27:22,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:23,129 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:27:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:27:23,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645754611] [2025-04-14 00:27:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645754611] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:27:23,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97393148] [2025-04-14 00:27:23,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:27:23,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:23,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:27:23,131 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:27:23,133 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:27:23,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:27:23,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:27:23,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:27:23,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:23,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:27:23,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:29:01,331 WARN L286 SmtUtils]: Spent 16.34s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:29:25,719 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:29:25,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:29:45,014 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:29:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97393148] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:29:45,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:29:45,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-14 00:29:45,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572416346] [2025-04-14 00:29:45,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:29:45,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:29:45,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:29:45,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:29:45,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=168, Unknown=13, NotChecked=0, Total=240 [2025-04-14 00:29:45,015 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-14 00:29:45,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 252 transitions, 2701 flow. Second operand has 16 states, 16 states have (on average 17.0625) internal successors, (273), 16 states have internal predecessors, (273), 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:45,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:29:45,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-14 00:29:45,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:29:47,098 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:49,950 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:57,466 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:59,712 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:30:00,868 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:30:05,405 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:07,555 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:09,786 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:12,716 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:26,195 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:30,198 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:39,651 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:30:43,921 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:47,923 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:51,926 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:55,929 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:59,931 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:04,013 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:16,196 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 44 DAG size of output: 41 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:31:18,046 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:31:22,095 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:26,098 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:30,100 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:34,104 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:38,110 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:31:41,458 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:31:45,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:31:49,466 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:53,133 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:31:57,256 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:01,262 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:05,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:32:09,267 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:13,269 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:17,275 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:20,285 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:23,514 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:24,951 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:32:30,014 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:34,017 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:38,020 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:42,026 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:46,029 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:50,039 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:54,438 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:58,442 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:02,449 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:06,455 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:10,743 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:14,770 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:19,205 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:23,208 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:27,212 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:31,214 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:35,218 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:39,224 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:43,228 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:46,585 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:50,588 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:54,594 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:58,596 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:02,598 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:06,600 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:45,447 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 44 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:34:54,475 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:58,477 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:35:02,481 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:35:03,640 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:07,643 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:35:11,649 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (* 4294967295 (div (* (- 1) c_~x5~0) 2)) 4294967296))) (let ((.cse4 (mod c_~x1~0 4294967296)) (.cse2 (+ .cse5 1)) (.cse1 (mod c_~x5~0 4294967296)) (.cse3 (mod c_~x6~0 4294967296)) (.cse0 (mod c_~n~0 4294967296)) (.cse6 (mod c_~x3~0 4294967296))) (and (<= .cse0 .cse1) (<= .cse2 .cse3) (= .cse4 (mod c_~x2~0 4294967296)) (<= .cse2 .cse0) (<= .cse3 .cse1) (<= 1 .cse5) (= .cse6 (mod c_~x4~0 4294967296)) (= (mod c_~x6~0 2) 0) (= (mod c_~x5~0 2) 0) (<= 1 .cse4) (<= .cse2 .cse1) (or (= .cse3 .cse1) (< (+ .cse3 2) .cse0)) (<= 1 .cse6) (= (mod (* (div (* (- 1) c_~x6~0) 2) 4294967295) 4294967296) .cse5)))) is different from false [2025-04-14 00:35:15,652 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:35:19,659 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:23,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:35:27,663 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:35:31,665 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:38:00,162 WARN L286 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 48 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:38:04,796 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:38:08,799 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:38:12,802 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:38:16,804 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:38:20,811 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:24,815 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:38:28,817 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:38:32,819 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:38:36,823 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:38:40,826 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:38:44,829 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:38:48,833 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:38:52,911 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:38:56,917 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:00,920 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:39:04,922 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:39:08,926 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:39:12,929 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:39:16,936 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:20,939 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:39:24,944 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:39:28,946 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:39:32,952 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:36,954 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:39:40,956 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:39:48,898 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:39:52,901 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:39:56,907 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:40:00,909 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:40:04,912 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:40:08,832 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:40:13,058 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:40:17,060 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:40:21,063 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:40:25,065 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:40:29,070 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:40:33,073 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:40:37,080 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:40:41,082 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:40:45,085 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:40:49,089 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:40:53,091 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:40:57,097 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:41:01,099 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:41:05,102 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:41:06,567 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-14 00:41:08,634 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:41:08,634 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:41:09,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 00:41:09,835 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:41:09,842 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-14 00:41:09,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:41:09,842 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 00:41:09,844 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:41:09,844 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-04-14 00:41:09,844 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-14 00:41:09,844 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-14 00:41:09,844 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-14 00:41:09,844 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-14 00:41:09,844 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2025-04-14 00:41:09,844 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-04-14 00:41:09,846 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:41:09,847 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:41:09,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:41:09 BasicIcfg [2025-04-14 00:41:09,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:41:09,849 INFO L158 Benchmark]: Toolchain (without parser) took 872936.53ms. Allocated memory was 125.8MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 87.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-14 00:41:09,849 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:41:09,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.99ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 71.9MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:41:09,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.85ms. Allocated memory is still 125.8MB. Free memory was 71.9MB in the beginning and 70.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:41:09,850 INFO L158 Benchmark]: Boogie Preprocessor took 34.74ms. Allocated memory is still 125.8MB. Free memory was 70.4MB in the beginning and 68.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:41:09,850 INFO L158 Benchmark]: IcfgBuilder took 451.48ms. Allocated memory is still 125.8MB. Free memory was 68.5MB in the beginning and 30.1MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 00:41:09,850 INFO L158 Benchmark]: TraceAbstraction took 872163.99ms. Allocated memory was 125.8MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 29.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-14 00:41:09,851 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.15ms. Allocated memory is still 167.8MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.99ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 71.9MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.85ms. Allocated memory is still 125.8MB. Free memory was 71.9MB in the beginning and 70.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.74ms. Allocated memory is still 125.8MB. Free memory was 70.4MB in the beginning and 68.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 451.48ms. Allocated memory is still 125.8MB. Free memory was 68.5MB in the beginning and 30.1MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 872163.99ms. Allocated memory was 125.8MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 29.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: 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 13 procedures, 64 locations, 75 edges, 7 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: 872.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 721.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 99 mSolverCounterUnknown, 1085 SdHoareTripleChecker+Valid, 460.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1085 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 459.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 148 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3768 IncrementalHoareTripleChecker+Invalid, 4108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 0 mSDtfsCounter, 3768 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 487 SyntacticMatches, 17 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 319.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2701occurred in iteration=14, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 147.9s InterpolantComputationTime, 762 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 997 ConstructedInterpolants, 0 QuantifiedInterpolants, 13797 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1966 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 6/36 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