/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/mult-flipped-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:12:43,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:12:43,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:12:43,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:12:43,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:12:43,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:12:43,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:12:43,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:12:43,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:12:43,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:12:43,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:12:43,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:12:43,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:12:43,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:12:43,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:12:43,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:12:43,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:12:43,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:12:43,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:12:43,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:12:43,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:12:43,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:12:43,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:12:43,087 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:12:43,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:12:43,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:12:43,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:12:43,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:12:43,323 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:12:43,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-flipped-dist.wvr.c [2025-04-13 20:12:44,643 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ab2007c/02bc8d62a39e42f5b312b7099855e7e4/FLAG68c7dbb67 [2025-04-13 20:12:44,876 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:12:44,876 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-flipped-dist.wvr.c [2025-04-13 20:12:44,884 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ab2007c/02bc8d62a39e42f5b312b7099855e7e4/FLAG68c7dbb67 [2025-04-13 20:12:45,692 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ab2007c/02bc8d62a39e42f5b312b7099855e7e4 [2025-04-13 20:12:45,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:12:45,695 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:12:45,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:12:45,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:12:45,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:12:45,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:45,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368f763c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45, skipping insertion in model container [2025-04-13 20:12:45,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:45,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:12:45,888 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/mult-flipped-dist.wvr.c[2174,2187] [2025-04-13 20:12:45,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:12:45,900 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:12:45,923 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/mult-flipped-dist.wvr.c[2174,2187] [2025-04-13 20:12:45,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:12:45,936 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:12:45,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45 WrapperNode [2025-04-13 20:12:45,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:12:45,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:12:45,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:12:45,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:12:45,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:45,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:45,966 INFO L138 Inliner]: procedures = 21, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2025-04-13 20:12:45,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:12:45,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:12:45,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:12:45,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:12:45,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:45,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:45,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:45,992 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:12:45,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:45,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:45,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:46,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:46,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:46,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:46,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:46,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:12:46,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:12:46,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:12:46,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:12:46,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (1/1) ... [2025-04-13 20:12:46,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:12:46,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:46,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:12:46,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:12:46,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:12:46,051 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:12:46,051 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:12:46,051 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:12:46,051 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:12:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:12:46,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:12:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:12:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:12:46,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:12:46,053 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:12:46,117 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:12:46,119 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:12:46,216 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:12:46,217 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:12:46,217 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:12:46,354 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:12:46,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:12:46 BoogieIcfgContainer [2025-04-13 20:12:46,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:12:46,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:12:46,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:12:46,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:12:46,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:12:45" (1/3) ... [2025-04-13 20:12:46,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9c3fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:12:46, skipping insertion in model container [2025-04-13 20:12:46,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:45" (2/3) ... [2025-04-13 20:12:46,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9c3fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:12:46, skipping insertion in model container [2025-04-13 20:12:46,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:12:46" (3/3) ... [2025-04-13 20:12:46,362 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2025-04-13 20:12:46,373 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:12:46,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-flipped-dist.wvr.c that has 4 procedures, 22 locations, 21 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 20:12:46,375 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:12:46,419 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:12:46,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 69 flow [2025-04-13 20:12:46,466 INFO L116 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-04-13 20:12:46,469 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:12:46,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 3/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-13 20:12:46,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 24 transitions, 69 flow [2025-04-13 20:12:46,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 20 transitions, 58 flow [2025-04-13 20:12:46,480 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:12:46,489 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;@5392da7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:12:46,489 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:12:46,497 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:12:46,497 INFO L116 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-04-13 20:12:46,497 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:12:46,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:46,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:46,499 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:46,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash -376192277, now seen corresponding path program 1 times [2025-04-13 20:12:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:46,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761853374] [2025-04-13 20:12:46,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:46,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:12:46,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:12:46,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:46,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:46,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761853374] [2025-04-13 20:12:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761853374] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:12:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801855613] [2025-04-13 20:12:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:46,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:12:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:46,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:12:46,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:12:46,979 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:46,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:46,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:46,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:46,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:47,146 INFO L116 PetriNetUnfolderBase]: 386/564 cut-off events. [2025-04-13 20:12:47,146 INFO L117 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-04-13 20:12:47,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 564 events. 386/564 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1761 event pairs, 124 based on Foata normal form. 1/415 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-04-13 20:12:47,156 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 4 changer transitions 1/37 dead transitions. [2025-04-13 20:12:47,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 37 transitions, 181 flow [2025-04-13 20:12:47,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:12:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:12:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-13 20:12:47,166 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2025-04-13 20:12:47,168 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 58 flow. Second operand 3 states and 47 transitions. [2025-04-13 20:12:47,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 37 transitions, 181 flow [2025-04-13 20:12:47,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 37 transitions, 159 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:12:47,174 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 72 flow [2025-04-13 20:12:47,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2025-04-13 20:12:47,179 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-04-13 20:12:47,179 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 72 flow [2025-04-13 20:12:47,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:47,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:47,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:47,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:12:47,180 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:47,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash 225204188, now seen corresponding path program 1 times [2025-04-13 20:12:47,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:47,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673917416] [2025-04-13 20:12:47,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:47,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:47,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:12:47,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:47,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:47,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:47,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-13 20:12:47,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:47,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673917416] [2025-04-13 20:12:47,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673917416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:47,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:47,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:12:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895941052] [2025-04-13 20:12:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:47,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:12:47,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:47,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:12:47,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:12:47,296 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:47,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:47,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:47,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:47,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:47,488 INFO L116 PetriNetUnfolderBase]: 480/728 cut-off events. [2025-04-13 20:12:47,488 INFO L117 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-04-13 20:12:47,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 728 events. 480/728 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2749 event pairs, 144 based on Foata normal form. 65/793 useless extension candidates. Maximal degree in co-relation 489. Up to 361 conditions per place. [2025-04-13 20:12:47,493 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 48 selfloop transitions, 6 changer transitions 3/57 dead transitions. [2025-04-13 20:12:47,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 57 transitions, 277 flow [2025-04-13 20:12:47,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:12:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:12:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-13 20:12:47,495 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2025-04-13 20:12:47,495 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 72 flow. Second operand 5 states and 71 transitions. [2025-04-13 20:12:47,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 57 transitions, 277 flow [2025-04-13 20:12:47,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 57 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:12:47,497 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 123 flow [2025-04-13 20:12:47,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-04-13 20:12:47,497 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2025-04-13 20:12:47,497 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 123 flow [2025-04-13 20:12:47,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:47,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:47,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:47,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:12:47,499 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:47,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2001548157, now seen corresponding path program 1 times [2025-04-13 20:12:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:47,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45557792] [2025-04-13 20:12:47,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:47,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:47,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:12:47,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:47,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:47,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:47,589 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-13 20:12:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:47,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45557792] [2025-04-13 20:12:47,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45557792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:47,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163869506] [2025-04-13 20:12:47,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:47,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:47,592 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-13 20:12:47,594 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-13 20:12:47,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:12:47,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:47,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:47,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:47,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:12:47,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:47,685 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-13 20:12:47,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:47,733 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-13 20:12:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163869506] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:47,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:12:47,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 20:12:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229606022] [2025-04-13 20:12:47,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:47,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:12:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:47,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:12:47,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:12:47,734 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:47,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:47,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:47,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:47,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:47,873 INFO L116 PetriNetUnfolderBase]: 535/814 cut-off events. [2025-04-13 20:12:47,873 INFO L117 PetriNetUnfolderBase]: For 874/874 co-relation queries the response was YES. [2025-04-13 20:12:47,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2583 conditions, 814 events. 535/814 cut-off events. For 874/874 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3037 event pairs, 139 based on Foata normal form. 38/852 useless extension candidates. Maximal degree in co-relation 880. Up to 467 conditions per place. [2025-04-13 20:12:47,881 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 41 selfloop transitions, 5 changer transitions 8/54 dead transitions. [2025-04-13 20:12:47,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 54 transitions, 337 flow [2025-04-13 20:12:47,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:12:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:12:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-13 20:12:47,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-13 20:12:47,883 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 123 flow. Second operand 4 states and 60 transitions. [2025-04-13 20:12:47,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 54 transitions, 337 flow [2025-04-13 20:12:47,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 54 transitions, 325 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:12:47,885 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 139 flow [2025-04-13 20:12:47,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2025-04-13 20:12:47,886 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2025-04-13 20:12:47,886 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 139 flow [2025-04-13 20:12:47,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:47,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:47,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:47,894 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-13 20:12:48,092 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-13 20:12:48,092 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:48,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash 974657520, now seen corresponding path program 1 times [2025-04-13 20:12:48,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:48,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349411081] [2025-04-13 20:12:48,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:48,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:48,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:12:48,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:48,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:48,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:48,152 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-13 20:12:48,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:48,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349411081] [2025-04-13 20:12:48,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349411081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:48,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:12:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004863376] [2025-04-13 20:12:48,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:48,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:12:48,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:48,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:12:48,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:12:48,153 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:48,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:48,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:48,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:48,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:48,292 INFO L116 PetriNetUnfolderBase]: 570/856 cut-off events. [2025-04-13 20:12:48,292 INFO L117 PetriNetUnfolderBase]: For 1805/1805 co-relation queries the response was YES. [2025-04-13 20:12:48,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 856 events. 570/856 cut-off events. For 1805/1805 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3281 event pairs, 241 based on Foata normal form. 16/872 useless extension candidates. Maximal degree in co-relation 1490. Up to 636 conditions per place. [2025-04-13 20:12:48,297 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 46 selfloop transitions, 12 changer transitions 3/61 dead transitions. [2025-04-13 20:12:48,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 61 transitions, 452 flow [2025-04-13 20:12:48,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:12:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:12:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-13 20:12:48,298 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-04-13 20:12:48,298 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 139 flow. Second operand 5 states and 66 transitions. [2025-04-13 20:12:48,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 61 transitions, 452 flow [2025-04-13 20:12:48,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 61 transitions, 440 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:12:48,303 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 230 flow [2025-04-13 20:12:48,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-04-13 20:12:48,305 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2025-04-13 20:12:48,305 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 230 flow [2025-04-13 20:12:48,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:48,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:48,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:48,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:12:48,305 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:48,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1704209632, now seen corresponding path program 2 times [2025-04-13 20:12:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:48,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246207389] [2025-04-13 20:12:48,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:48,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:48,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:48,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:48,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:48,377 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-13 20:12:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:48,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246207389] [2025-04-13 20:12:48,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246207389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:48,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:48,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:12:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904944140] [2025-04-13 20:12:48,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:48,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:12:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:48,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:12:48,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:12:48,378 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:48,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:48,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:48,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:48,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:48,506 INFO L116 PetriNetUnfolderBase]: 701/1073 cut-off events. [2025-04-13 20:12:48,507 INFO L117 PetriNetUnfolderBase]: For 3334/3334 co-relation queries the response was YES. [2025-04-13 20:12:48,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4338 conditions, 1073 events. 701/1073 cut-off events. For 3334/3334 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4471 event pairs, 215 based on Foata normal form. 42/1115 useless extension candidates. Maximal degree in co-relation 3299. Up to 600 conditions per place. [2025-04-13 20:12:48,511 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 54 selfloop transitions, 8 changer transitions 4/66 dead transitions. [2025-04-13 20:12:48,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 542 flow [2025-04-13 20:12:48,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:12:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:12:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-13 20:12:48,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-04-13 20:12:48,512 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 230 flow. Second operand 4 states and 57 transitions. [2025-04-13 20:12:48,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 542 flow [2025-04-13 20:12:48,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 510 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:12:48,517 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 266 flow [2025-04-13 20:12:48,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-04-13 20:12:48,518 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2025-04-13 20:12:48,518 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 266 flow [2025-04-13 20:12:48,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:48,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:48,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:48,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:12:48,518 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:48,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash 322729902, now seen corresponding path program 3 times [2025-04-13 20:12:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:48,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060829908] [2025-04-13 20:12:48,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:48,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:48,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:48,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:48,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:48,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:48,636 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-13 20:12:48,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:48,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060829908] [2025-04-13 20:12:48,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060829908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:48,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568055620] [2025-04-13 20:12:48,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:48,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:48,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:48,638 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-13 20:12:48,640 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-13 20:12:48,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:48,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:48,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:48,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:48,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:12:48,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:48,715 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-13 20:12:48,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:48,752 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-13 20:12:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568055620] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:48,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:48,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2025-04-13 20:12:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310316545] [2025-04-13 20:12:48,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:48,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:12:48,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:48,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:12:48,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:12:48,754 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:48,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 266 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:48,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:48,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:48,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:49,007 INFO L116 PetriNetUnfolderBase]: 970/1471 cut-off events. [2025-04-13 20:12:49,008 INFO L117 PetriNetUnfolderBase]: For 5836/5836 co-relation queries the response was YES. [2025-04-13 20:12:49,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6688 conditions, 1471 events. 970/1471 cut-off events. For 5836/5836 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6394 event pairs, 249 based on Foata normal form. 39/1510 useless extension candidates. Maximal degree in co-relation 5244. Up to 856 conditions per place. [2025-04-13 20:12:49,015 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 80 selfloop transitions, 39 changer transitions 10/129 dead transitions. [2025-04-13 20:12:49,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 129 transitions, 1278 flow [2025-04-13 20:12:49,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:12:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:12:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-04-13 20:12:49,017 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2025-04-13 20:12:49,017 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 266 flow. Second operand 10 states and 119 transitions. [2025-04-13 20:12:49,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 129 transitions, 1278 flow [2025-04-13 20:12:49,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 129 transitions, 1176 flow, removed 38 selfloop flow, removed 2 redundant places. [2025-04-13 20:12:49,024 INFO L231 Difference]: Finished difference. Result has 54 places, 68 transitions, 687 flow [2025-04-13 20:12:49,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=687, PETRI_PLACES=54, PETRI_TRANSITIONS=68} [2025-04-13 20:12:49,024 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 27 predicate places. [2025-04-13 20:12:49,024 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 687 flow [2025-04-13 20:12:49,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:49,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:49,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:49,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:12:49,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:12:49,225 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:49,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:49,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1137506418, now seen corresponding path program 2 times [2025-04-13 20:12:49,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:49,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405413146] [2025-04-13 20:12:49,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:49,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:49,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:49,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:49,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:49,349 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-13 20:12:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:49,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405413146] [2025-04-13 20:12:49,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405413146] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:49,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499782074] [2025-04-13 20:12:49,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:49,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:49,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:49,352 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-13 20:12:49,354 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-13 20:12:49,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:49,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:49,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:49,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:49,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:12:49,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:49,451 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-13 20:12:49,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:49,513 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-13 20:12:49,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499782074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:49,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:49,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-04-13 20:12:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389348532] [2025-04-13 20:12:49,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:49,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:12:49,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:49,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:12:49,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:12:49,515 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:49,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 68 transitions, 687 flow. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:49,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:49,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:49,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:50,085 INFO L116 PetriNetUnfolderBase]: 1147/1727 cut-off events. [2025-04-13 20:12:50,085 INFO L117 PetriNetUnfolderBase]: For 9894/9894 co-relation queries the response was YES. [2025-04-13 20:12:50,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9097 conditions, 1727 events. 1147/1727 cut-off events. For 9894/9894 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7536 event pairs, 164 based on Foata normal form. 136/1863 useless extension candidates. Maximal degree in co-relation 7491. Up to 671 conditions per place. [2025-04-13 20:12:50,098 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 99 selfloop transitions, 110 changer transitions 11/220 dead transitions. [2025-04-13 20:12:50,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 220 transitions, 2452 flow [2025-04-13 20:12:50,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:12:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:12:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2025-04-13 20:12:50,099 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2025-04-13 20:12:50,099 INFO L175 Difference]: Start difference. First operand has 54 places, 68 transitions, 687 flow. Second operand 15 states and 175 transitions. [2025-04-13 20:12:50,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 220 transitions, 2452 flow [2025-04-13 20:12:50,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 220 transitions, 2372 flow, removed 40 selfloop flow, removed 0 redundant places. [2025-04-13 20:12:50,112 INFO L231 Difference]: Finished difference. Result has 78 places, 146 transitions, 1889 flow [2025-04-13 20:12:50,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1889, PETRI_PLACES=78, PETRI_TRANSITIONS=146} [2025-04-13 20:12:50,113 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 51 predicate places. [2025-04-13 20:12:50,113 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 146 transitions, 1889 flow [2025-04-13 20:12:50,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:50,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:50,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:50,119 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-13 20:12:50,317 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-13 20:12:50,317 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:50,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2049491522, now seen corresponding path program 4 times [2025-04-13 20:12:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:50,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992944378] [2025-04-13 20:12:50,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:50,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:50,325 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:50,329 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:50,329 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:50,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:50,373 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-13 20:12:50,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:50,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992944378] [2025-04-13 20:12:50,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992944378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:50,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:50,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:12:50,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9490609] [2025-04-13 20:12:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:50,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:12:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:50,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:12:50,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:12:50,374 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:50,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 146 transitions, 1889 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:50,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:50,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:50,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:50,563 INFO L116 PetriNetUnfolderBase]: 1111/1689 cut-off events. [2025-04-13 20:12:50,563 INFO L117 PetriNetUnfolderBase]: For 13999/13999 co-relation queries the response was YES. [2025-04-13 20:12:50,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10649 conditions, 1689 events. 1111/1689 cut-off events. For 13999/13999 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7362 event pairs, 288 based on Foata normal form. 12/1701 useless extension candidates. Maximal degree in co-relation 9584. Up to 1024 conditions per place. [2025-04-13 20:12:50,574 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 104 selfloop transitions, 43 changer transitions 21/168 dead transitions. [2025-04-13 20:12:50,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 168 transitions, 2413 flow [2025-04-13 20:12:50,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:12:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:12:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-13 20:12:50,575 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2025-04-13 20:12:50,576 INFO L175 Difference]: Start difference. First operand has 78 places, 146 transitions, 1889 flow. Second operand 4 states and 53 transitions. [2025-04-13 20:12:50,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 168 transitions, 2413 flow [2025-04-13 20:12:50,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 168 transitions, 2167 flow, removed 97 selfloop flow, removed 4 redundant places. [2025-04-13 20:12:50,606 INFO L231 Difference]: Finished difference. Result has 78 places, 140 transitions, 1678 flow [2025-04-13 20:12:50,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1678, PETRI_PLACES=78, PETRI_TRANSITIONS=140} [2025-04-13 20:12:50,606 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 51 predicate places. [2025-04-13 20:12:50,606 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 140 transitions, 1678 flow [2025-04-13 20:12:50,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:50,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:50,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:50,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:12:50,607 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:50,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1345712302, now seen corresponding path program 3 times [2025-04-13 20:12:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:50,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805727146] [2025-04-13 20:12:50,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:50,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:50,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:50,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:50,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:50,683 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-13 20:12:50,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:50,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805727146] [2025-04-13 20:12:50,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805727146] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:50,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632199700] [2025-04-13 20:12:50,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:50,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:50,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:50,686 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-13 20:12:50,687 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-13 20:12:50,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:50,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:50,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:50,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:50,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:12:50,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:50,741 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-13 20:12:50,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:50,765 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-13 20:12:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632199700] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:12:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2025-04-13 20:12:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209355602] [2025-04-13 20:12:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:50,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:12:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:50,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:12:50,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:12:50,766 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:50,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 140 transitions, 1678 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:50,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:50,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:50,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:50,946 INFO L116 PetriNetUnfolderBase]: 1107/1674 cut-off events. [2025-04-13 20:12:50,946 INFO L117 PetriNetUnfolderBase]: For 12222/12222 co-relation queries the response was YES. [2025-04-13 20:12:50,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10034 conditions, 1674 events. 1107/1674 cut-off events. For 12222/12222 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7232 event pairs, 210 based on Foata normal form. 34/1708 useless extension candidates. Maximal degree in co-relation 8979. Up to 1302 conditions per place. [2025-04-13 20:12:50,957 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 129 selfloop transitions, 43 changer transitions 9/181 dead transitions. [2025-04-13 20:12:50,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 181 transitions, 2422 flow [2025-04-13 20:12:50,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:12:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:12:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-13 20:12:50,960 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-04-13 20:12:50,960 INFO L175 Difference]: Start difference. First operand has 78 places, 140 transitions, 1678 flow. Second operand 4 states and 58 transitions. [2025-04-13 20:12:50,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 181 transitions, 2422 flow [2025-04-13 20:12:50,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 181 transitions, 2318 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-13 20:12:50,985 INFO L231 Difference]: Finished difference. Result has 79 places, 149 transitions, 1847 flow [2025-04-13 20:12:50,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1847, PETRI_PLACES=79, PETRI_TRANSITIONS=149} [2025-04-13 20:12:50,986 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 52 predicate places. [2025-04-13 20:12:50,986 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 149 transitions, 1847 flow [2025-04-13 20:12:50,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:50,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:50,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:50,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:12:51,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:51,187 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:51,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2020606422, now seen corresponding path program 4 times [2025-04-13 20:12:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:51,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915473156] [2025-04-13 20:12:51,188 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:51,196 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:51,199 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:51,200 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:51,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:51,256 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-13 20:12:51,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:51,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915473156] [2025-04-13 20:12:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915473156] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:51,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095050893] [2025-04-13 20:12:51,256 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:51,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:51,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:51,258 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-13 20:12:51,259 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-13 20:12:51,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:12:51,298 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:12:51,299 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:51,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:51,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:12:51,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:51,322 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-13 20:12:51,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:51,360 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-13 20:12:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095050893] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:51,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:51,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 20:12:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277062334] [2025-04-13 20:12:51,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:51,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:12:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:51,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:12:51,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:12:51,361 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:51,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 149 transitions, 1847 flow. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:51,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:51,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:51,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:51,584 INFO L116 PetriNetUnfolderBase]: 1202/1772 cut-off events. [2025-04-13 20:12:51,585 INFO L117 PetriNetUnfolderBase]: For 13176/13176 co-relation queries the response was YES. [2025-04-13 20:12:51,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10924 conditions, 1772 events. 1202/1772 cut-off events. For 13176/13176 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7480 event pairs, 286 based on Foata normal form. 46/1818 useless extension candidates. Maximal degree in co-relation 10239. Up to 1203 conditions per place. [2025-04-13 20:12:51,618 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 119 selfloop transitions, 90 changer transitions 6/215 dead transitions. [2025-04-13 20:12:51,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 215 transitions, 2957 flow [2025-04-13 20:12:51,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:12:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:12:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2025-04-13 20:12:51,619 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:12:51,619 INFO L175 Difference]: Start difference. First operand has 79 places, 149 transitions, 1847 flow. Second operand 7 states and 84 transitions. [2025-04-13 20:12:51,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 215 transitions, 2957 flow [2025-04-13 20:12:51,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 215 transitions, 2863 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-13 20:12:51,642 INFO L231 Difference]: Finished difference. Result has 83 places, 176 transitions, 2417 flow [2025-04-13 20:12:51,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2417, PETRI_PLACES=83, PETRI_TRANSITIONS=176} [2025-04-13 20:12:51,644 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 56 predicate places. [2025-04-13 20:12:51,644 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 176 transitions, 2417 flow [2025-04-13 20:12:51,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:51,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:51,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:51,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:12:51,844 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,SelfDestructingSolverStorable9 [2025-04-13 20:12:51,844 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:51,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:51,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1123669077, now seen corresponding path program 1 times [2025-04-13 20:12:51,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:51,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196135705] [2025-04-13 20:12:51,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:12:51,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:12:51,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:51,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:12:51,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:51,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196135705] [2025-04-13 20:12:51,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196135705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:51,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527104188] [2025-04-13 20:12:51,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:51,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:51,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:51,905 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-13 20:12:51,907 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-13 20:12:51,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:12:51,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:12:51,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:51,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:51,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:12:51,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:12:51,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:12:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527104188] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:12:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 20:12:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932612989] [2025-04-13 20:12:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:52,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:12:52,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:52,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:12:52,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:12:52,005 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:52,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 176 transitions, 2417 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:52,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:52,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:52,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:52,162 INFO L116 PetriNetUnfolderBase]: 1278/1838 cut-off events. [2025-04-13 20:12:52,162 INFO L117 PetriNetUnfolderBase]: For 13678/13678 co-relation queries the response was YES. [2025-04-13 20:12:52,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12067 conditions, 1838 events. 1278/1838 cut-off events. For 13678/13678 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7487 event pairs, 166 based on Foata normal form. 18/1856 useless extension candidates. Maximal degree in co-relation 10443. Up to 1462 conditions per place. [2025-04-13 20:12:52,172 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 176 selfloop transitions, 49 changer transitions 1/226 dead transitions. [2025-04-13 20:12:52,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 226 transitions, 3369 flow [2025-04-13 20:12:52,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:12:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:12:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-13 20:12:52,172 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-13 20:12:52,173 INFO L175 Difference]: Start difference. First operand has 83 places, 176 transitions, 2417 flow. Second operand 4 states and 56 transitions. [2025-04-13 20:12:52,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 226 transitions, 3369 flow [2025-04-13 20:12:52,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 226 transitions, 3099 flow, removed 102 selfloop flow, removed 1 redundant places. [2025-04-13 20:12:52,200 INFO L231 Difference]: Finished difference. Result has 85 places, 187 transitions, 2491 flow [2025-04-13 20:12:52,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2190, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2491, PETRI_PLACES=85, PETRI_TRANSITIONS=187} [2025-04-13 20:12:52,200 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 58 predicate places. [2025-04-13 20:12:52,200 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 187 transitions, 2491 flow [2025-04-13 20:12:52,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:52,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:52,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:52,206 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-13 20:12:52,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:52,401 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:52,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1890975375, now seen corresponding path program 1 times [2025-04-13 20:12:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:52,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995748697] [2025-04-13 20:12:52,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:52,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:12:52,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:52,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:52,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:52,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:52,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995748697] [2025-04-13 20:12:52,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995748697] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:52,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313711104] [2025-04-13 20:12:52,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:52,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:52,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:52,532 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-13 20:12:52,534 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-13 20:12:52,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:12:52,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:52,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:52,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:52,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:12:52,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:52,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313711104] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:53,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:53,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 11 [2025-04-13 20:12:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728289600] [2025-04-13 20:12:53,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:53,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:12:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:53,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:12:53,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:12:53,082 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:53,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 187 transitions, 2491 flow. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:53,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:53,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:53,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:53,445 INFO L116 PetriNetUnfolderBase]: 1815/2617 cut-off events. [2025-04-13 20:12:53,445 INFO L117 PetriNetUnfolderBase]: For 18248/18248 co-relation queries the response was YES. [2025-04-13 20:12:53,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16001 conditions, 2617 events. 1815/2617 cut-off events. For 18248/18248 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11185 event pairs, 139 based on Foata normal form. 2/2619 useless extension candidates. Maximal degree in co-relation 14645. Up to 1943 conditions per place. [2025-04-13 20:12:53,461 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 221 selfloop transitions, 70 changer transitions 2/293 dead transitions. [2025-04-13 20:12:53,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 293 transitions, 3956 flow [2025-04-13 20:12:53,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:12:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:12:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-04-13 20:12:53,462 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5787037037037037 [2025-04-13 20:12:53,462 INFO L175 Difference]: Start difference. First operand has 85 places, 187 transitions, 2491 flow. Second operand 9 states and 125 transitions. [2025-04-13 20:12:53,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 293 transitions, 3956 flow [2025-04-13 20:12:53,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 293 transitions, 3921 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 20:12:53,507 INFO L231 Difference]: Finished difference. Result has 94 places, 233 transitions, 3282 flow [2025-04-13 20:12:53,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2456, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3282, PETRI_PLACES=94, PETRI_TRANSITIONS=233} [2025-04-13 20:12:53,507 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 67 predicate places. [2025-04-13 20:12:53,507 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 233 transitions, 3282 flow [2025-04-13 20:12:53,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:53,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:53,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:53,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 20:12:53,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:53,712 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 1 more)] === [2025-04-13 20:12:53,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash -476198415, now seen corresponding path program 2 times [2025-04-13 20:12:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:53,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804763095] [2025-04-13 20:12:53,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:53,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:53,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:53,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:53,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:53,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804763095] [2025-04-13 20:12:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804763095] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:53,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956223093] [2025-04-13 20:12:53,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:53,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:53,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:53,826 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-13 20:12:53,827 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-13 20:12:53,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:53,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:53,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:53,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:53,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:12:53,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:53,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956223093] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:54,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:54,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 11 [2025-04-13 20:12:54,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161003985] [2025-04-13 20:12:54,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:54,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:12:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:54,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:12:54,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:12:54,365 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:54,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 233 transitions, 3282 flow. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:54,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:54,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:54,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:54,749 INFO L116 PetriNetUnfolderBase]: 2094/3025 cut-off events. [2025-04-13 20:12:54,750 INFO L117 PetriNetUnfolderBase]: For 24695/24695 co-relation queries the response was YES. [2025-04-13 20:12:54,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19727 conditions, 3025 events. 2094/3025 cut-off events. For 24695/24695 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 13189 event pairs, 259 based on Foata normal form. 2/3027 useless extension candidates. Maximal degree in co-relation 19089. Up to 2447 conditions per place. [2025-04-13 20:12:54,764 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 242 selfloop transitions, 66 changer transitions 2/310 dead transitions. [2025-04-13 20:12:54,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 310 transitions, 4534 flow [2025-04-13 20:12:54,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:12:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:12:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2025-04-13 20:12:54,766 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-04-13 20:12:54,766 INFO L175 Difference]: Start difference. First operand has 94 places, 233 transitions, 3282 flow. Second operand 9 states and 122 transitions. [2025-04-13 20:12:54,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 310 transitions, 4534 flow [2025-04-13 20:12:54,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 310 transitions, 4324 flow, removed 93 selfloop flow, removed 1 redundant places. [2025-04-13 20:12:54,820 INFO L231 Difference]: Finished difference. Result has 104 places, 253 transitions, 3557 flow [2025-04-13 20:12:54,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3072, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3557, PETRI_PLACES=104, PETRI_TRANSITIONS=253} [2025-04-13 20:12:54,821 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 77 predicate places. [2025-04-13 20:12:54,821 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 253 transitions, 3557 flow [2025-04-13 20:12:54,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:54,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:54,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:54,828 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-13 20:12:55,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 20:12:55,022 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 1 more)] === [2025-04-13 20:12:55,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:55,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1500874961, now seen corresponding path program 3 times [2025-04-13 20:12:55,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:55,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043696737] [2025-04-13 20:12:55,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:55,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:55,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:55,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:55,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:55,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:55,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043696737] [2025-04-13 20:12:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043696737] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:55,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013996387] [2025-04-13 20:12:55,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:55,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:55,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:55,126 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:55,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:12:55,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:55,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:55,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:55,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:55,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:12:55,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:55,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:55,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013996387] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:55,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 11 [2025-04-13 20:12:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784813496] [2025-04-13 20:12:55,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:55,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:12:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:55,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:12:55,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:12:55,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:55,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 253 transitions, 3557 flow. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:55,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:55,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:55,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:56,111 INFO L116 PetriNetUnfolderBase]: 2605/3767 cut-off events. [2025-04-13 20:12:56,111 INFO L117 PetriNetUnfolderBase]: For 31759/31759 co-relation queries the response was YES. [2025-04-13 20:12:56,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24452 conditions, 3767 events. 2605/3767 cut-off events. For 31759/31759 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17105 event pairs, 380 based on Foata normal form. 2/3769 useless extension candidates. Maximal degree in co-relation 23932. Up to 3139 conditions per place. [2025-04-13 20:12:56,132 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 282 selfloop transitions, 70 changer transitions 2/354 dead transitions. [2025-04-13 20:12:56,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 354 transitions, 5314 flow [2025-04-13 20:12:56,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:12:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:12:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2025-04-13 20:12:56,134 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-04-13 20:12:56,134 INFO L175 Difference]: Start difference. First operand has 104 places, 253 transitions, 3557 flow. Second operand 9 states and 122 transitions. [2025-04-13 20:12:56,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 354 transitions, 5314 flow [2025-04-13 20:12:56,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 354 transitions, 5107 flow, removed 76 selfloop flow, removed 2 redundant places. [2025-04-13 20:12:56,214 INFO L231 Difference]: Finished difference. Result has 114 places, 299 transitions, 4346 flow [2025-04-13 20:12:56,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3350, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4346, PETRI_PLACES=114, PETRI_TRANSITIONS=299} [2025-04-13 20:12:56,215 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 87 predicate places. [2025-04-13 20:12:56,215 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 299 transitions, 4346 flow [2025-04-13 20:12:56,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:56,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:56,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:56,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:12:56,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:12:56,416 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 1 more)] === [2025-04-13 20:12:56,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash -115800115, now seen corresponding path program 4 times [2025-04-13 20:12:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:56,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246605491] [2025-04-13 20:12:56,416 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:56,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:56,422 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:56,426 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:56,426 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:56,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:56,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:56,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246605491] [2025-04-13 20:12:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246605491] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:56,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391460999] [2025-04-13 20:12:56,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:56,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:56,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:56,533 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:56,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:12:56,563 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:56,578 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:56,578 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:56,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:56,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:12:56,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:56,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:57,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391460999] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:57,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:57,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 11 [2025-04-13 20:12:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596578559] [2025-04-13 20:12:57,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:57,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:12:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:57,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:12:57,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:12:57,017 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:57,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 299 transitions, 4346 flow. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:57,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:57,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:57,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:57,495 INFO L116 PetriNetUnfolderBase]: 2939/4247 cut-off events. [2025-04-13 20:12:57,495 INFO L117 PetriNetUnfolderBase]: For 38908/38908 co-relation queries the response was YES. [2025-04-13 20:12:57,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28254 conditions, 4247 events. 2939/4247 cut-off events. For 38908/38908 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 19727 event pairs, 485 based on Foata normal form. 2/4249 useless extension candidates. Maximal degree in co-relation 27705. Up to 3688 conditions per place. [2025-04-13 20:12:57,519 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 303 selfloop transitions, 74 changer transitions 2/379 dead transitions. [2025-04-13 20:12:57,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 379 transitions, 5952 flow [2025-04-13 20:12:57,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:12:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:12:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2025-04-13 20:12:57,520 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2025-04-13 20:12:57,520 INFO L175 Difference]: Start difference. First operand has 114 places, 299 transitions, 4346 flow. Second operand 9 states and 118 transitions. [2025-04-13 20:12:57,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 379 transitions, 5952 flow [2025-04-13 20:12:57,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 379 transitions, 5664 flow, removed 132 selfloop flow, removed 1 redundant places. [2025-04-13 20:12:57,664 INFO L231 Difference]: Finished difference. Result has 124 places, 327 transitions, 4775 flow [2025-04-13 20:12:57,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4058, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4775, PETRI_PLACES=124, PETRI_TRANSITIONS=327} [2025-04-13 20:12:57,666 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 97 predicate places. [2025-04-13 20:12:57,666 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 327 transitions, 4775 flow [2025-04-13 20:12:57,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:57,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:57,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:57,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:12:57,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:12:57,867 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:57,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:57,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1009932621, now seen corresponding path program 5 times [2025-04-13 20:12:57,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:57,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384844886] [2025-04-13 20:12:57,867 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:12:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:57,870 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:57,873 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:57,873 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:57,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:57,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:57,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384844886] [2025-04-13 20:12:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384844886] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:57,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913040187] [2025-04-13 20:12:57,958 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:12:57,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:57,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:57,960 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:57,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:12:57,988 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:58,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:58,002 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:58,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:58,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:12:58,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:58,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:59,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913040187] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:59,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:59,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2025-04-13 20:12:59,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739938843] [2025-04-13 20:12:59,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:59,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:12:59,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:59,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:12:59,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:12:59,049 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:12:59,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 327 transitions, 4775 flow. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:59,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:59,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:12:59,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:59,522 INFO L116 PetriNetUnfolderBase]: 3321/4797 cut-off events. [2025-04-13 20:12:59,522 INFO L117 PetriNetUnfolderBase]: For 44353/44353 co-relation queries the response was YES. [2025-04-13 20:12:59,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31974 conditions, 4797 events. 3321/4797 cut-off events. For 44353/44353 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 22781 event pairs, 653 based on Foata normal form. 1/4798 useless extension candidates. Maximal degree in co-relation 31383. Up to 4328 conditions per place. [2025-04-13 20:12:59,548 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 355 selfloop transitions, 81 changer transitions 1/437 dead transitions. [2025-04-13 20:12:59,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 437 transitions, 6996 flow [2025-04-13 20:12:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:12:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:12:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-04-13 20:12:59,553 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-04-13 20:12:59,553 INFO L175 Difference]: Start difference. First operand has 124 places, 327 transitions, 4775 flow. Second operand 8 states and 103 transitions. [2025-04-13 20:12:59,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 437 transitions, 6996 flow [2025-04-13 20:12:59,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 437 transitions, 6720 flow, removed 111 selfloop flow, removed 2 redundant places. [2025-04-13 20:12:59,673 INFO L231 Difference]: Finished difference. Result has 132 places, 384 transitions, 5744 flow [2025-04-13 20:12:59,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4499, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5744, PETRI_PLACES=132, PETRI_TRANSITIONS=384} [2025-04-13 20:12:59,673 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 105 predicate places. [2025-04-13 20:12:59,674 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 384 transitions, 5744 flow [2025-04-13 20:12:59,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:59,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:59,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:59,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 20:12:59,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:12:59,874 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:59,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash 487699883, now seen corresponding path program 6 times [2025-04-13 20:12:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:59,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867519360] [2025-04-13 20:12:59,875 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:12:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:59,878 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:59,884 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:59,885 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:12:59,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:59,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867519360] [2025-04-13 20:12:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867519360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:59,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504389989] [2025-04-13 20:12:59,974 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:12:59,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:59,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:59,975 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:59,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:13:00,001 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:13:00,014 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:13:00,015 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:00,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:00,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:13:00,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:00,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:00,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504389989] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:00,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:00,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 11 [2025-04-13 20:13:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576599694] [2025-04-13 20:13:00,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:00,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:13:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:00,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:13:00,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:13:00,769 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:13:00,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 384 transitions, 5744 flow. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:00,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:00,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:13:00,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:01,349 INFO L116 PetriNetUnfolderBase]: 3577/5168 cut-off events. [2025-04-13 20:13:01,349 INFO L117 PetriNetUnfolderBase]: For 48822/48822 co-relation queries the response was YES. [2025-04-13 20:13:01,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34828 conditions, 5168 events. 3577/5168 cut-off events. For 48822/48822 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 24893 event pairs, 757 based on Foata normal form. 1/5169 useless extension candidates. Maximal degree in co-relation 34220. Up to 4678 conditions per place. [2025-04-13 20:13:01,373 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 372 selfloop transitions, 87 changer transitions 1/460 dead transitions. [2025-04-13 20:13:01,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 460 transitions, 7599 flow [2025-04-13 20:13:01,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:13:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:13:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-04-13 20:13:01,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-04-13 20:13:01,374 INFO L175 Difference]: Start difference. First operand has 132 places, 384 transitions, 5744 flow. Second operand 8 states and 102 transitions. [2025-04-13 20:13:01,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 460 transitions, 7599 flow [2025-04-13 20:13:01,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 460 transitions, 7237 flow, removed 169 selfloop flow, removed 1 redundant places. [2025-04-13 20:13:01,508 INFO L231 Difference]: Finished difference. Result has 140 places, 407 transitions, 6117 flow [2025-04-13 20:13:01,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5382, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6117, PETRI_PLACES=140, PETRI_TRANSITIONS=407} [2025-04-13 20:13:01,508 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 113 predicate places. [2025-04-13 20:13:01,508 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 407 transitions, 6117 flow [2025-04-13 20:13:01,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:01,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:01,508 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:01,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:01,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 20:13:01,709 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:13:01,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:01,710 INFO L85 PathProgramCache]: Analyzing trace with hash -145196826, now seen corresponding path program 7 times [2025-04-13 20:13:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:01,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864479688] [2025-04-13 20:13:01,710 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:01,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:01,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:13:01,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:01,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:01,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:01,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:01,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864479688] [2025-04-13 20:13:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864479688] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:01,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137699754] [2025-04-13 20:13:01,778 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:01,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:01,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:01,779 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:01,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:13:01,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:13:01,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:01,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:01,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:01,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:13:01,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:01,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:01,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137699754] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:01,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:01,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-13 20:13:01,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944806106] [2025-04-13 20:13:01,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:01,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:13:01,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:01,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:13:01,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:13:01,894 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:13:01,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 407 transitions, 6117 flow. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:01,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:01,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:13:01,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:02,958 INFO L116 PetriNetUnfolderBase]: 5466/7764 cut-off events. [2025-04-13 20:13:02,958 INFO L117 PetriNetUnfolderBase]: For 84403/84403 co-relation queries the response was YES. [2025-04-13 20:13:02,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52202 conditions, 7764 events. 5466/7764 cut-off events. For 84403/84403 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 38306 event pairs, 478 based on Foata normal form. 68/7832 useless extension candidates. Maximal degree in co-relation 50942. Up to 2302 conditions per place. [2025-04-13 20:13:03,011 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 628 selfloop transitions, 221 changer transitions 0/849 dead transitions. [2025-04-13 20:13:03,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 849 transitions, 13579 flow [2025-04-13 20:13:03,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:13:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:13:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2025-04-13 20:13:03,012 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5705128205128205 [2025-04-13 20:13:03,012 INFO L175 Difference]: Start difference. First operand has 140 places, 407 transitions, 6117 flow. Second operand 13 states and 178 transitions. [2025-04-13 20:13:03,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 849 transitions, 13579 flow [2025-04-13 20:13:03,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 849 transitions, 12711 flow, removed 398 selfloop flow, removed 2 redundant places. [2025-04-13 20:13:03,248 INFO L231 Difference]: Finished difference. Result has 158 places, 509 transitions, 7828 flow [2025-04-13 20:13:03,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5783, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7828, PETRI_PLACES=158, PETRI_TRANSITIONS=509} [2025-04-13 20:13:03,248 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 131 predicate places. [2025-04-13 20:13:03,248 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 509 transitions, 7828 flow [2025-04-13 20:13:03,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:03,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:03,249 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:03,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:13:03,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 20:13:03,453 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:13:03,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash -455188271, now seen corresponding path program 8 times [2025-04-13 20:13:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:03,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252386987] [2025-04-13 20:13:03,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:03,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:03,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:03,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:03,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:03,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252386987] [2025-04-13 20:13:03,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252386987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:03,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369694247] [2025-04-13 20:13:03,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:03,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:03,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:03,528 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:03,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:13:03,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:03,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:03,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:03,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:03,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:13:03,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:03,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:03,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369694247] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:03,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:03,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 20:13:03,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144851931] [2025-04-13 20:13:03,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:03,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:13:03,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:03,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:13:03,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:13:03,666 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:13:03,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 509 transitions, 7828 flow. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:03,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:03,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:13:03,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:04,944 INFO L116 PetriNetUnfolderBase]: 6508/9094 cut-off events. [2025-04-13 20:13:04,944 INFO L117 PetriNetUnfolderBase]: For 121669/121669 co-relation queries the response was YES. [2025-04-13 20:13:04,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68258 conditions, 9094 events. 6508/9094 cut-off events. For 121669/121669 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 44068 event pairs, 1395 based on Foata normal form. 108/9202 useless extension candidates. Maximal degree in co-relation 66683. Up to 6101 conditions per place. [2025-04-13 20:13:04,999 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 562 selfloop transitions, 371 changer transitions 0/933 dead transitions. [2025-04-13 20:13:04,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 933 transitions, 15551 flow [2025-04-13 20:13:04,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:13:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:13:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 231 transitions. [2025-04-13 20:13:05,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2025-04-13 20:13:05,000 INFO L175 Difference]: Start difference. First operand has 158 places, 509 transitions, 7828 flow. Second operand 18 states and 231 transitions. [2025-04-13 20:13:05,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 933 transitions, 15551 flow [2025-04-13 20:13:05,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 933 transitions, 14819 flow, removed 303 selfloop flow, removed 1 redundant places. [2025-04-13 20:13:05,428 INFO L231 Difference]: Finished difference. Result has 181 places, 693 transitions, 11144 flow [2025-04-13 20:13:05,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7346, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11144, PETRI_PLACES=181, PETRI_TRANSITIONS=693} [2025-04-13 20:13:05,428 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 154 predicate places. [2025-04-13 20:13:05,428 INFO L485 AbstractCegarLoop]: Abstraction has has 181 places, 693 transitions, 11144 flow [2025-04-13 20:13:05,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:05,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:05,429 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:05,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:05,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:05,629 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:13:05,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1657368942, now seen corresponding path program 9 times [2025-04-13 20:13:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:05,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042550670] [2025-04-13 20:13:05,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:05,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:05,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:05,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:05,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:13:05,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:05,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:05,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042550670] [2025-04-13 20:13:05,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042550670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:05,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367317986] [2025-04-13 20:13:05,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:05,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:05,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:05,755 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:05,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:13:05,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:05,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:05,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:13:05,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:05,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:13:05,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:05,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367317986] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:05,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 20:13:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49726975] [2025-04-13 20:13:05,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:05,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:13:05,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:05,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:13:05,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:13:05,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:13:05,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 693 transitions, 11144 flow. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:05,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:05,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:13:05,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:07,571 INFO L116 PetriNetUnfolderBase]: 7712/10680 cut-off events. [2025-04-13 20:13:07,571 INFO L117 PetriNetUnfolderBase]: For 169530/169530 co-relation queries the response was YES. [2025-04-13 20:13:07,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85171 conditions, 10680 events. 7712/10680 cut-off events. For 169530/169530 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 52277 event pairs, 1441 based on Foata normal form. 182/10862 useless extension candidates. Maximal degree in co-relation 83143. Up to 6818 conditions per place. [2025-04-13 20:13:07,642 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 704 selfloop transitions, 386 changer transitions 0/1090 dead transitions. [2025-04-13 20:13:07,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 1090 transitions, 19793 flow [2025-04-13 20:13:07,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:13:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:13:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 165 transitions. [2025-04-13 20:13:07,643 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2025-04-13 20:13:07,643 INFO L175 Difference]: Start difference. First operand has 181 places, 693 transitions, 11144 flow. Second operand 14 states and 165 transitions. [2025-04-13 20:13:07,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 1090 transitions, 19793 flow [2025-04-13 20:13:08,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1090 transitions, 18511 flow, removed 505 selfloop flow, removed 1 redundant places. [2025-04-13 20:13:08,451 INFO L231 Difference]: Finished difference. Result has 201 places, 866 transitions, 14392 flow [2025-04-13 20:13:08,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=10554, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14392, PETRI_PLACES=201, PETRI_TRANSITIONS=866} [2025-04-13 20:13:08,452 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 174 predicate places. [2025-04-13 20:13:08,452 INFO L485 AbstractCegarLoop]: Abstraction has has 201 places, 866 transitions, 14392 flow [2025-04-13 20:13:08,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:08,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:08,452 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:08,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:08,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:08,653 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:13:08,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1044196586, now seen corresponding path program 10 times [2025-04-13 20:13:08,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:08,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082350915] [2025-04-13 20:13:08,654 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:08,658 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:08,664 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:08,664 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:08,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:08,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:08,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082350915] [2025-04-13 20:13:08,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082350915] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:08,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929837410] [2025-04-13 20:13:08,754 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:08,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:08,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:08,755 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:08,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 20:13:08,785 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:08,796 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:08,796 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:08,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:08,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:13:08,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:08,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:08,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929837410] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:08,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:08,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-13 20:13:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398873740] [2025-04-13 20:13:08,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:08,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:13:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:08,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:13:08,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:13:08,897 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:13:08,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 866 transitions, 14392 flow. Second operand has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:08,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:08,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:13:08,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:13,608 INFO L116 PetriNetUnfolderBase]: 10617/14573 cut-off events. [2025-04-13 20:13:13,609 INFO L117 PetriNetUnfolderBase]: For 310713/310713 co-relation queries the response was YES. [2025-04-13 20:13:13,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132165 conditions, 14573 events. 10617/14573 cut-off events. For 310713/310713 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 73919 event pairs, 982 based on Foata normal form. 620/15193 useless extension candidates. Maximal degree in co-relation 129788. Up to 5771 conditions per place. [2025-04-13 20:13:13,722 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 762 selfloop transitions, 1489 changer transitions 1/2252 dead transitions. [2025-04-13 20:13:13,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 2252 transitions, 43077 flow [2025-04-13 20:13:13,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-04-13 20:13:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2025-04-13 20:13:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 1105 transitions. [2025-04-13 20:13:13,725 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4147897897897898 [2025-04-13 20:13:13,725 INFO L175 Difference]: Start difference. First operand has 201 places, 866 transitions, 14392 flow. Second operand 111 states and 1105 transitions. [2025-04-13 20:13:13,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 2252 transitions, 43077 flow [2025-04-13 20:13:15,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 2252 transitions, 41570 flow, removed 703 selfloop flow, removed 2 redundant places. [2025-04-13 20:13:15,505 INFO L231 Difference]: Finished difference. Result has 373 places, 1834 transitions, 38487 flow [2025-04-13 20:13:15,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=13749, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=616, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=111, PETRI_FLOW=38487, PETRI_PLACES=373, PETRI_TRANSITIONS=1834} [2025-04-13 20:13:15,506 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 346 predicate places. [2025-04-13 20:13:15,507 INFO L485 AbstractCegarLoop]: Abstraction has has 373 places, 1834 transitions, 38487 flow [2025-04-13 20:13:15,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:15,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:15,507 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:15,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 20:13:15,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:15,707 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:13:15,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash 370242746, now seen corresponding path program 11 times [2025-04-13 20:13:15,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:15,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107796987] [2025-04-13 20:13:15,708 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:15,712 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:15,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:15,716 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:15,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:15,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:15,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107796987] [2025-04-13 20:13:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107796987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:15,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486339858] [2025-04-13 20:13:15,784 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:15,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:15,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:15,786 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:15,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 20:13:15,816 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:15,829 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:15,829 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:15,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:15,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:13:15,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:15,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:15,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486339858] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:15,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:15,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-13 20:13:15,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093278507] [2025-04-13 20:13:15,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:15,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:13:15,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:15,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:13:15,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:13:15,940 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:13:15,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1834 transitions, 38487 flow. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:15,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:15,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:13:15,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:21,009 INFO L116 PetriNetUnfolderBase]: 10681/14921 cut-off events. [2025-04-13 20:13:21,009 INFO L117 PetriNetUnfolderBase]: For 416494/416494 co-relation queries the response was YES. [2025-04-13 20:13:21,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151401 conditions, 14921 events. 10681/14921 cut-off events. For 416494/416494 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 79616 event pairs, 1040 based on Foata normal form. 527/15448 useless extension candidates. Maximal degree in co-relation 150696. Up to 5433 conditions per place. [2025-04-13 20:13:21,185 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 960 selfloop transitions, 960 changer transitions 255/2175 dead transitions. [2025-04-13 20:13:21,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 2175 transitions, 48156 flow [2025-04-13 20:13:21,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 20:13:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-13 20:13:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 366 transitions. [2025-04-13 20:13:21,187 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4485294117647059 [2025-04-13 20:13:21,187 INFO L175 Difference]: Start difference. First operand has 373 places, 1834 transitions, 38487 flow. Second operand 34 states and 366 transitions. [2025-04-13 20:13:21,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 2175 transitions, 48156 flow [2025-04-13 20:13:26,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 2175 transitions, 38091 flow, removed 4538 selfloop flow, removed 11 redundant places. [2025-04-13 20:13:26,213 INFO L231 Difference]: Finished difference. Result has 413 places, 1756 transitions, 30595 flow [2025-04-13 20:13:26,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=27755, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=844, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=30595, PETRI_PLACES=413, PETRI_TRANSITIONS=1756} [2025-04-13 20:13:26,215 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 386 predicate places. [2025-04-13 20:13:26,215 INFO L485 AbstractCegarLoop]: Abstraction has has 413 places, 1756 transitions, 30595 flow [2025-04-13 20:13:26,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:26,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:26,215 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:26,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:26,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:26,416 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:13:26,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 654201392, now seen corresponding path program 12 times [2025-04-13 20:13:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:26,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489375268] [2025-04-13 20:13:26,417 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:26,420 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:26,427 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:26,427 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:26,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:26,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:26,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489375268] [2025-04-13 20:13:26,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489375268] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:26,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470022216] [2025-04-13 20:13:26,539 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:26,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:26,541 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:26,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 20:13:26,573 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:26,585 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:26,585 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:26,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:26,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:13:26,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:26,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:26,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470022216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:26,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:26,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-04-13 20:13:26,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607444573] [2025-04-13 20:13:26,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:26,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:13:26,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:26,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:13:26,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:13:26,667 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:13:26,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 1756 transitions, 30595 flow. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:26,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:26,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:13:26,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:31,179 INFO L116 PetriNetUnfolderBase]: 11083/15412 cut-off events. [2025-04-13 20:13:31,179 INFO L117 PetriNetUnfolderBase]: For 355789/355789 co-relation queries the response was YES. [2025-04-13 20:13:31,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147485 conditions, 15412 events. 11083/15412 cut-off events. For 355789/355789 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 81901 event pairs, 894 based on Foata normal form. 211/15623 useless extension candidates. Maximal degree in co-relation 147227. Up to 4738 conditions per place. [2025-04-13 20:13:31,351 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 1452 selfloop transitions, 972 changer transitions 0/2424 dead transitions. [2025-04-13 20:13:31,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 2424 transitions, 47085 flow [2025-04-13 20:13:31,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 20:13:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 20:13:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 286 transitions. [2025-04-13 20:13:31,352 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5181159420289855 [2025-04-13 20:13:31,352 INFO L175 Difference]: Start difference. First operand has 413 places, 1756 transitions, 30595 flow. Second operand 23 states and 286 transitions. [2025-04-13 20:13:31,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 2424 transitions, 47085 flow [2025-04-13 20:13:35,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 2424 transitions, 45420 flow, removed 481 selfloop flow, removed 10 redundant places. [2025-04-13 20:13:35,119 INFO L231 Difference]: Finished difference. Result has 429 places, 1955 transitions, 35756 flow [2025-04-13 20:13:35,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=29279, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=809, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=35756, PETRI_PLACES=429, PETRI_TRANSITIONS=1955} [2025-04-13 20:13:35,120 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 402 predicate places. [2025-04-13 20:13:35,120 INFO L485 AbstractCegarLoop]: Abstraction has has 429 places, 1955 transitions, 35756 flow [2025-04-13 20:13:35,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:35,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:35,120 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:35,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:35,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:35,321 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:13:35,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash 467134097, now seen corresponding path program 13 times [2025-04-13 20:13:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:35,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875461244] [2025-04-13 20:13:35,322 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:35,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:13:35,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:35,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:35,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:35,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:35,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875461244] [2025-04-13 20:13:35,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875461244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:35,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500711643] [2025-04-13 20:13:35,379 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:35,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:35,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:35,381 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:35,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 20:13:35,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:13:35,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:35,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:35,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:35,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:13:35,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:35,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500711643] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:35,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-04-13 20:13:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861453560] [2025-04-13 20:13:35,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:35,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:13:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:35,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:13:35,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:13:35,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:13:35,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 1955 transitions, 35756 flow. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:35,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:35,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:13:35,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:41,567 INFO L116 PetriNetUnfolderBase]: 12801/17689 cut-off events. [2025-04-13 20:13:41,567 INFO L117 PetriNetUnfolderBase]: For 467586/467586 co-relation queries the response was YES. [2025-04-13 20:13:41,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179293 conditions, 17689 events. 12801/17689 cut-off events. For 467586/467586 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 94794 event pairs, 837 based on Foata normal form. 324/18013 useless extension candidates. Maximal degree in co-relation 178484. Up to 5715 conditions per place. [2025-04-13 20:13:41,770 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 1848 selfloop transitions, 1281 changer transitions 6/3135 dead transitions. [2025-04-13 20:13:41,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 3135 transitions, 64158 flow [2025-04-13 20:13:41,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 20:13:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-04-13 20:13:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 629 transitions. [2025-04-13 20:13:41,772 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.416005291005291 [2025-04-13 20:13:41,772 INFO L175 Difference]: Start difference. First operand has 429 places, 1955 transitions, 35756 flow. Second operand 63 states and 629 transitions. [2025-04-13 20:13:41,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 3135 transitions, 64158 flow [2025-04-13 20:13:46,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 3135 transitions, 62103 flow, removed 506 selfloop flow, removed 5 redundant places. [2025-04-13 20:13:46,886 INFO L231 Difference]: Finished difference. Result has 529 places, 2455 transitions, 48979 flow [2025-04-13 20:13:46,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=33931, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=821, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=48979, PETRI_PLACES=529, PETRI_TRANSITIONS=2455} [2025-04-13 20:13:46,888 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 502 predicate places. [2025-04-13 20:13:46,888 INFO L485 AbstractCegarLoop]: Abstraction has has 529 places, 2455 transitions, 48979 flow [2025-04-13 20:13:46,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:46,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:46,888 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:46,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 20:13:47,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:47,089 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:13:47,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:47,089 INFO L85 PathProgramCache]: Analyzing trace with hash 658702262, now seen corresponding path program 14 times [2025-04-13 20:13:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:47,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408649778] [2025-04-13 20:13:47,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:47,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:47,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:47,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:47,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:47,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:47,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408649778] [2025-04-13 20:13:47,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408649778] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:47,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090198477] [2025-04-13 20:13:47,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:47,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:47,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:47,169 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:47,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 20:13:47,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:13:47,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:13:47,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:47,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:47,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:13:47,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:47,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:13:47,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090198477] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:47,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:47,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-04-13 20:13:47,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720144968] [2025-04-13 20:13:47,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:47,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:13:47,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:47,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:13:47,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:13:47,349 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:13:47,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 2455 transitions, 48979 flow. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:47,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:47,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:13:47,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:56,520 INFO L116 PetriNetUnfolderBase]: 18332/25022 cut-off events. [2025-04-13 20:13:56,520 INFO L117 PetriNetUnfolderBase]: For 752939/752939 co-relation queries the response was YES. [2025-04-13 20:13:56,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275551 conditions, 25022 events. 18332/25022 cut-off events. For 752939/752939 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 136018 event pairs, 782 based on Foata normal form. 116/25138 useless extension candidates. Maximal degree in co-relation 274569. Up to 8365 conditions per place. [2025-04-13 20:13:56,928 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 3368 selfloop transitions, 1030 changer transitions 118/4516 dead transitions. [2025-04-13 20:13:56,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 4516 transitions, 103847 flow [2025-04-13 20:13:56,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:13:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:13:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 158 transitions. [2025-04-13 20:13:56,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5064102564102564 [2025-04-13 20:13:56,929 INFO L175 Difference]: Start difference. First operand has 529 places, 2455 transitions, 48979 flow. Second operand 13 states and 158 transitions. [2025-04-13 20:13:56,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 4516 transitions, 103847 flow [2025-04-13 20:14:08,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 4516 transitions, 98274 flow, removed 2129 selfloop flow, removed 20 redundant places. [2025-04-13 20:14:09,050 INFO L231 Difference]: Finished difference. Result has 529 places, 2915 transitions, 58610 flow [2025-04-13 20:14:09,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=45539, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=603, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=58610, PETRI_PLACES=529, PETRI_TRANSITIONS=2915} [2025-04-13 20:14:09,052 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 502 predicate places. [2025-04-13 20:14:09,052 INFO L485 AbstractCegarLoop]: Abstraction has has 529 places, 2915 transitions, 58610 flow [2025-04-13 20:14:09,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:09,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:09,053 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:09,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 20:14:09,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 20:14:09,256 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:09,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:09,257 INFO L85 PathProgramCache]: Analyzing trace with hash -936782924, now seen corresponding path program 15 times [2025-04-13 20:14:09,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:09,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2332645] [2025-04-13 20:14:09,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:14:09,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:09,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:14:09,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:14:09,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:14:09,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:09,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:09,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2332645] [2025-04-13 20:14:09,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2332645] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:09,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663045944] [2025-04-13 20:14:09,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:14:09,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:09,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:09,394 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:14:09,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 20:14:09,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:14:09,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:14:09,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:14:09,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:09,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:14:09,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:09,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663045944] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:14:09,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:14:09,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-13 20:14:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864324255] [2025-04-13 20:14:09,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:14:09,550 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:14:09,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:09,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:14:09,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:14:09,551 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:14:09,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 2915 transitions, 58610 flow. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:09,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:09,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:14:09,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:21,987 INFO L116 PetriNetUnfolderBase]: 22009/30021 cut-off events. [2025-04-13 20:14:21,988 INFO L117 PetriNetUnfolderBase]: For 1083300/1083300 co-relation queries the response was YES. [2025-04-13 20:14:22,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344570 conditions, 30021 events. 22009/30021 cut-off events. For 1083300/1083300 co-relation queries the response was YES. Maximal size of possible extension queue 1471. Compared 168659 event pairs, 3094 based on Foata normal form. 307/30328 useless extension candidates. Maximal degree in co-relation 343831. Up to 17510 conditions per place. [2025-04-13 20:14:22,544 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 2809 selfloop transitions, 1197 changer transitions 5/4011 dead transitions. [2025-04-13 20:14:22,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 4011 transitions, 89719 flow [2025-04-13 20:14:22,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:14:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:14:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 250 transitions. [2025-04-13 20:14:22,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-04-13 20:14:22,546 INFO L175 Difference]: Start difference. First operand has 529 places, 2915 transitions, 58610 flow. Second operand 20 states and 250 transitions. [2025-04-13 20:14:22,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 4011 transitions, 89719 flow [2025-04-13 20:14:39,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 4011 transitions, 86200 flow, removed 1479 selfloop flow, removed 2 redundant places. [2025-04-13 20:14:39,895 INFO L231 Difference]: Finished difference. Result has 560 places, 3308 transitions, 69901 flow [2025-04-13 20:14:39,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=56594, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=856, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=69901, PETRI_PLACES=560, PETRI_TRANSITIONS=3308} [2025-04-13 20:14:39,897 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 533 predicate places. [2025-04-13 20:14:39,897 INFO L485 AbstractCegarLoop]: Abstraction has has 560 places, 3308 transitions, 69901 flow [2025-04-13 20:14:39,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:39,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:39,898 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:39,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 20:14:40,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:14:40,098 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:40,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1009466352, now seen corresponding path program 16 times [2025-04-13 20:14:40,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:40,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23882283] [2025-04-13 20:14:40,099 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:14:40,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:40,102 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:14:40,105 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:14:40,105 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:14:40,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:40,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:40,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23882283] [2025-04-13 20:14:40,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23882283] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:40,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973218160] [2025-04-13 20:14:40,189 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:14:40,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:40,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:40,191 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:14:40,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 20:14:40,222 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:14:40,234 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:14:40,234 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:14:40,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:40,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:14:40,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:40,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:40,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973218160] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:14:40,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:14:40,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 20:14:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451436289] [2025-04-13 20:14:40,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:14:40,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:14:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:40,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:14:40,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:14:40,367 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:14:40,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 3308 transitions, 69901 flow. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:40,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:40,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:14:40,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:45,878 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-13 20:14:52,793 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-13 20:15:06,451 INFO L116 PetriNetUnfolderBase]: 27633/37438 cut-off events. [2025-04-13 20:15:06,451 INFO L117 PetriNetUnfolderBase]: For 1441197/1441197 co-relation queries the response was YES. [2025-04-13 20:15:07,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447258 conditions, 37438 events. 27633/37438 cut-off events. For 1441197/1441197 co-relation queries the response was YES. Maximal size of possible extension queue 1814. Compared 213274 event pairs, 2853 based on Foata normal form. 620/38058 useless extension candidates. Maximal degree in co-relation 446487. Up to 18693 conditions per place. [2025-04-13 20:15:07,424 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 3578 selfloop transitions, 2017 changer transitions 154/5749 dead transitions. [2025-04-13 20:15:07,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 5749 transitions, 142046 flow [2025-04-13 20:15:07,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 20:15:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-13 20:15:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 442 transitions. [2025-04-13 20:15:07,425 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4185606060606061 [2025-04-13 20:15:07,425 INFO L175 Difference]: Start difference. First operand has 560 places, 3308 transitions, 69901 flow. Second operand 44 states and 442 transitions. [2025-04-13 20:15:07,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 5749 transitions, 142046 flow [2025-04-13 20:15:35,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 5749 transitions, 136882 flow, removed 2310 selfloop flow, removed 2 redundant places. [2025-04-13 20:15:35,395 INFO L231 Difference]: Finished difference. Result has 630 places, 4438 transitions, 105301 flow [2025-04-13 20:15:35,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67855, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=105301, PETRI_PLACES=630, PETRI_TRANSITIONS=4438} [2025-04-13 20:15:35,398 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 603 predicate places. [2025-04-13 20:15:35,398 INFO L485 AbstractCegarLoop]: Abstraction has has 630 places, 4438 transitions, 105301 flow [2025-04-13 20:15:35,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:35,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:35,398 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:35,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 20:15:35,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:15:35,599 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:15:35,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash -317796618, now seen corresponding path program 17 times [2025-04-13 20:15:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:35,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613842661] [2025-04-13 20:15:35,600 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:15:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:35,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:15:35,607 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:15:35,607 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:35,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:35,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:35,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613842661] [2025-04-13 20:15:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613842661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:35,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568160725] [2025-04-13 20:15:35,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:15:35,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:35,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:35,678 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:15:35,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 20:15:35,706 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:15:35,720 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:15:35,720 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:35,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:35,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:15:35,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:35,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:35,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568160725] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:35,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:35,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 20:15:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033300019] [2025-04-13 20:15:35,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:35,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:15:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:35,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:15:35,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:15:35,824 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:15:35,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 4438 transitions, 105301 flow. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:35,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:35,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:15:35,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:04,721 INFO L116 PetriNetUnfolderBase]: 35301/47247 cut-off events. [2025-04-13 20:16:04,722 INFO L117 PetriNetUnfolderBase]: For 2029637/2029637 co-relation queries the response was YES. [2025-04-13 20:16:06,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612786 conditions, 47247 events. 35301/47247 cut-off events. For 2029637/2029637 co-relation queries the response was YES. Maximal size of possible extension queue 2228. Compared 268806 event pairs, 2723 based on Foata normal form. 304/47551 useless extension candidates. Maximal degree in co-relation 611964. Up to 20928 conditions per place. [2025-04-13 20:16:07,065 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 3916 selfloop transitions, 2523 changer transitions 43/6482 dead transitions. [2025-04-13 20:16:07,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 6482 transitions, 172517 flow [2025-04-13 20:16:07,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:16:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:16:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 192 transitions. [2025-04-13 20:16:07,066 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:16:07,066 INFO L175 Difference]: Start difference. First operand has 630 places, 4438 transitions, 105301 flow. Second operand 16 states and 192 transitions. [2025-04-13 20:16:07,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 6482 transitions, 172517 flow [2025-04-13 20:17:01,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 6482 transitions, 161824 flow, removed 4638 selfloop flow, removed 5 redundant places. [2025-04-13 20:17:01,779 INFO L231 Difference]: Finished difference. Result has 648 places, 5529 transitions, 133552 flow [2025-04-13 20:17:01,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=98011, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1561, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=133552, PETRI_PLACES=648, PETRI_TRANSITIONS=5529} [2025-04-13 20:17:01,785 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 621 predicate places. [2025-04-13 20:17:01,786 INFO L485 AbstractCegarLoop]: Abstraction has has 648 places, 5529 transitions, 133552 flow [2025-04-13 20:17:01,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:01,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:01,786 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:17:01,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 20:17:01,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:17:01,986 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:17:01,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash 968090584, now seen corresponding path program 18 times [2025-04-13 20:17:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:01,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999884755] [2025-04-13 20:17:01,987 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:17:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:01,990 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 20:17:01,993 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:17:01,993 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:17:01,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:17:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:02,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999884755] [2025-04-13 20:17:02,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999884755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:17:02,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83354752] [2025-04-13 20:17:02,039 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:17:02,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:17:02,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:17:02,040 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:17:02,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 20:17:02,066 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 20:17:02,076 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:17:02,076 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:17:02,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:02,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:17:02,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:17:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:17:02,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:17:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:17:02,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83354752] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:17:02,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:17:02,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 20:17:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761456374] [2025-04-13 20:17:02,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:17:02,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:17:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:02,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:17:02,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:17:02,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:17:02,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 5529 transitions, 133552 flow. Second operand has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:17:02,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:02,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:17:02,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:14,366 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-13 20:17:55,903 INFO L116 PetriNetUnfolderBase]: 46830/62490 cut-off events. [2025-04-13 20:17:55,903 INFO L117 PetriNetUnfolderBase]: For 2722243/2722243 co-relation queries the response was YES. [2025-04-13 20:17:58,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837495 conditions, 62490 events. 46830/62490 cut-off events. For 2722243/2722243 co-relation queries the response was YES. Maximal size of possible extension queue 3002. Compared 366328 event pairs, 4991 based on Foata normal form. 889/63379 useless extension candidates. Maximal degree in co-relation 836615. Up to 36262 conditions per place. [2025-04-13 20:17:59,068 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 5446 selfloop transitions, 4038 changer transitions 75/9559 dead transitions. [2025-04-13 20:17:59,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 9559 transitions, 260196 flow [2025-04-13 20:17:59,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-13 20:17:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-04-13 20:17:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 861 transitions. [2025-04-13 20:17:59,070 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39861111111111114 [2025-04-13 20:17:59,070 INFO L175 Difference]: Start difference. First operand has 648 places, 5529 transitions, 133552 flow. Second operand 90 states and 861 transitions. [2025-04-13 20:17:59,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 9559 transitions, 260196 flow [2025-04-13 20:19:34,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 734 places, 9559 transitions, 253222 flow, removed 3463 selfloop flow, removed 2 redundant places. [2025-04-13 20:19:34,153 INFO L231 Difference]: Finished difference. Result has 796 places, 7994 transitions, 215637 flow [2025-04-13 20:19:34,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=126461, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1796, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2897, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=215637, PETRI_PLACES=796, PETRI_TRANSITIONS=7994} [2025-04-13 20:19:34,158 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 769 predicate places. [2025-04-13 20:19:34,158 INFO L485 AbstractCegarLoop]: Abstraction has has 796 places, 7994 transitions, 215637 flow [2025-04-13 20:19:34,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:19:34,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:34,158 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:19:34,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 20:19:34,358 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 20:19:34,359 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:19:34,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash -652345610, now seen corresponding path program 19 times [2025-04-13 20:19:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:34,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802570612] [2025-04-13 20:19:34,360 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:19:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:34,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:19:34,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:19:34,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:19:34,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:19:34,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:34,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802570612] [2025-04-13 20:19:34,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802570612] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:19:34,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572416346] [2025-04-13 20:19:34,432 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:19:34,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:19:34,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:19:34,434 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:19:34,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 20:19:34,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:19:34,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:19:34,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:19:34,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:34,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:19:34,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:19:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:19:34,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:19:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:19:34,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572416346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:19:34,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:19:34,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 20:19:34,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261884418] [2025-04-13 20:19:34,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:19:34,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:19:34,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:34,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:19:34,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:19:34,598 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:19:34,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 796 places, 7994 transitions, 215637 flow. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:19:34,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:34,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:19:34,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:19,936 INFO L116 PetriNetUnfolderBase]: 56977/75854 cut-off events. [2025-04-13 20:21:19,937 INFO L117 PetriNetUnfolderBase]: For 3428327/3428327 co-relation queries the response was YES. [2025-04-13 20:21:24,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061409 conditions, 75854 events. 56977/75854 cut-off events. For 3428327/3428327 co-relation queries the response was YES. Maximal size of possible extension queue 3750. Compared 454969 event pairs, 6968 based on Foata normal form. 730/76584 useless extension candidates. Maximal degree in co-relation 1060536. Up to 49056 conditions per place. [2025-04-13 20:21:24,587 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 6840 selfloop transitions, 4615 changer transitions 61/11516 dead transitions. [2025-04-13 20:21:24,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 883 places, 11516 transitions, 336846 flow [2025-04-13 20:21:24,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-04-13 20:21:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2025-04-13 20:21:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 821 transitions. [2025-04-13 20:21:24,589 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3759157509157509 [2025-04-13 20:21:24,589 INFO L175 Difference]: Start difference. First operand has 796 places, 7994 transitions, 215637 flow. Second operand 91 states and 821 transitions. [2025-04-13 20:21:24,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 883 places, 11516 transitions, 336846 flow [2025-04-13 20:24:26,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 11516 transitions, 325795 flow, removed 5135 selfloop flow, removed 4 redundant places. [2025-04-13 20:24:26,437 INFO L231 Difference]: Finished difference. Result has 936 places, 10033 transitions, 286769 flow [2025-04-13 20:24:26,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=205907, PETRI_DIFFERENCE_MINUEND_PLACES=789, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2836, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=286769, PETRI_PLACES=936, PETRI_TRANSITIONS=10033} [2025-04-13 20:24:26,443 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 909 predicate places. [2025-04-13 20:24:26,443 INFO L485 AbstractCegarLoop]: Abstraction has has 936 places, 10033 transitions, 286769 flow [2025-04-13 20:24:26,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:24:26,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:24:26,443 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:24:26,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 20:24:26,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:26,644 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:24:26,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:24:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash -707522184, now seen corresponding path program 20 times [2025-04-13 20:24:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:24:26,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807325719] [2025-04-13 20:24:26,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:24:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:24:26,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:24:26,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:24:26,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:24:26,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:24:26,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:26,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807325719] [2025-04-13 20:24:26,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807325719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:24:26,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556595996] [2025-04-13 20:24:26,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:24:26,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:26,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:24:26,786 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:24:26,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 20:24:26,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:24:26,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:24:26,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:24:26,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:26,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:24:26,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:24:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:24:26,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:24:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:24:26,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556595996] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:24:26,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:24:26,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-04-13 20:24:26,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595542739] [2025-04-13 20:24:26,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:24:26,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:24:26,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:24:26,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:24:26,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:24:26,959 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-04-13 20:24:26,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 10033 transitions, 286769 flow. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:24:26,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:24:26,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-04-13 20:24:26,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-13 20:25:22,866 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:25:22,866 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-13 20:25:23,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:25:23,563 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:25:23,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 20:25:23,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-13 20:25:23,764 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 3/24 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 331848 conditions, 25381 events (18668/25380 cut-off events. For 1243042/1243042 co-relation queries the response was YES. Maximal size of possible extension queue 3749. Compared 164453 event pairs, 3133 based on Foata normal form. 139/29270 useless extension candidates. Maximal degree in co-relation 331425. Up to 18033 conditions per place.). [2025-04-13 20:25:23,766 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:25:23,766 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:25:23,766 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:25:23,767 INFO L422 BasicCegarLoop]: Path program histogram: [20, 4, 4, 1, 1, 1] [2025-04-13 20:25:23,770 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:25:23,770 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:25:23,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:25:23 BasicIcfg [2025-04-13 20:25:23,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:25:23,773 INFO L158 Benchmark]: Toolchain (without parser) took 758078.25ms. Allocated memory was 125.8MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 86.1MB in the beginning and 1.1GB in the end (delta: -993.9MB). Peak memory consumption was 6.4GB. Max. memory is 8.0GB. [2025-04-13 20:25:23,774 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:25:23,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.09ms. Allocated memory is still 125.8MB. Free memory was 85.4MB in the beginning and 71.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:25:23,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.71ms. Allocated memory is still 125.8MB. Free memory was 71.2MB in the beginning and 69.6MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:25:23,774 INFO L158 Benchmark]: Boogie Preprocessor took 39.14ms. Allocated memory is still 125.8MB. Free memory was 69.6MB in the beginning and 68.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:25:23,774 INFO L158 Benchmark]: RCFGBuilder took 349.25ms. Allocated memory is still 125.8MB. Free memory was 67.6MB in the beginning and 40.9MB in the end (delta: 26.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 20:25:23,774 INFO L158 Benchmark]: TraceAbstraction took 757415.55ms. Allocated memory was 125.8MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 40.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 6.4GB. Max. memory is 8.0GB. [2025-04-13 20:25:23,775 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.27ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.09ms. Allocated memory is still 125.8MB. Free memory was 85.4MB in the beginning and 71.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.71ms. Allocated memory is still 125.8MB. Free memory was 71.2MB in the beginning and 69.6MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.14ms. Allocated memory is still 125.8MB. Free memory was 69.6MB in the beginning and 68.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 349.25ms. Allocated memory is still 125.8MB. Free memory was 67.6MB in the beginning and 40.9MB in the end (delta: 26.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 757415.55ms. Allocated memory was 125.8MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 40.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 6.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 3/24 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 331848 conditions, 25381 events (18668/25380 cut-off events. For 1243042/1243042 co-relation queries the response was YES. Maximal size of possible extension queue 3749. Compared 164453 event pairs, 3133 based on Foata normal form. 139/29270 useless extension candidates. Maximal degree in co-relation 331425. Up to 18033 conditions per place.). - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 3/24 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 331848 conditions, 25381 events (18668/25380 cut-off events. For 1243042/1243042 co-relation queries the response was YES. Maximal size of possible extension queue 3749. Compared 164453 event pairs, 3133 based on Foata normal form. 139/29270 useless extension candidates. Maximal degree in co-relation 331425. Up to 18033 conditions per place.). - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 3/24 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 331848 conditions, 25381 events (18668/25380 cut-off events. For 1243042/1243042 co-relation queries the response was YES. Maximal size of possible extension queue 3749. Compared 164453 event pairs, 3133 based on Foata normal form. 139/29270 useless extension candidates. Maximal degree in co-relation 331425. Up to 18033 conditions per place.). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 3/24 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 331848 conditions, 25381 events (18668/25380 cut-off events. For 1243042/1243042 co-relation queries the response was YES. Maximal size of possible extension queue 3749. Compared 164453 event pairs, 3133 based on Foata normal form. 139/29270 useless extension candidates. Maximal degree in co-relation 331425. Up to 18033 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 34 locations, 39 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 757.3s, OverallIterations: 31, TraceHistogramMax: 2, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 742.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 3020 SdHoareTripleChecker+Valid, 20.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3020 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 19.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18812 IncrementalHoareTripleChecker+Invalid, 19155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 0 mSDtfsCounter, 18812 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1750 GetRequests, 1001 SyntacticMatches, 19 SemanticMatches, 730 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14086 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286769occurred in iteration=30, InterpolantAutomatonStates: 667, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1135 NumberOfCodeBlocks, 1135 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 1575 ConstructedInterpolants, 0 QuantifiedInterpolants, 8201 SizeOfPredicates, 47 NumberOfNonLiveVariables, 3629 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 83 InterpolantComputations, 8 PerfectInterpolantSequences, 65/301 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